Show simple item record

dc.contributor.authorKløve, Torleiveng
dc.date.accessioned2011-02-10T11:57:37Z
dc.date.available2011-02-10T11:57:37Z
dc.date.issued2011eng
dc.identifier.urihttps://hdl.handle.net/1956/4493
dc.description.abstractLower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are givenen_US
dc.language.isoengeng
dc.publisherSpringeren_US
dc.rightsAttribution-NonCommercial CC BY-NCeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc/2.5/eng
dc.subjectPermutationseng
dc.subjectChebychev distanceeng
dc.subjectSphereseng
dc.titleLower bounds on the size of spheres of permutations under the Chebychev distanceen_US
dc.typePeer reviewed
dc.typeJournal article
dc.description.versionpublishedVersionen_US
dc.rights.holderThe Author(s)en_US
dc.rights.holderCopyright The Author(s) 2010.en_US
dc.identifier.doihttps://doi.org/10.1007/s10623-010-9454-0
dc.identifier.cristin858046
dc.source.journalDesigns, Codes and Cryptography
dc.subject.nsiVDP::Mathematics and natural science: 400en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial CC BY-NC
Except where otherwise noted, this item's license is described as Attribution-NonCommercial CC BY-NC