An Improvement on the Gilbert–Varshamov Bound for Permutation Codes

DOI10.1109/TIT.2013.2237945MaRDI QIDQ2989271zbMATH OpenOpenAlexFDO

Authors Fei Gao, Yiting Yang, Gennian Ge

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2013.2237945

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited in

(14)

• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Constructing permutation arrays from groups
• Using permutation rational functions to obtain permutation arrays with large Hamming distance
• Improved lower bounds for permutation arrays using permutation rational functions
• A lower bound on permutation codes of distance \(n-1\)
• Constructing permutation arrays using partition and extension
• A note on good permutation codes from Reed-Solomon codes
• New theoretical bounds and constructions of permutation codes under block permutation metric
• A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
• An improvement of the Gilbert bound for constant weight codes (Corresp.)
• Extending permutation arrays: improving MOLS bounds
• New nonexistence results on perfect permutation codes under the Hamming metric
• New upper bounds for the size of permutation codes via linear programming
• Upper bounds on the size of permutation codes with a Hamming distance of five

This page was built for publication: An Improvement on the Gilbert–Varshamov Bound for Permutation Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989271)