An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
From MaRDI portal
Publication:2989271
DOI10.1109/TIT.2013.2237945zbMATH Open1364.94781OpenAlexW1972398039MaRDI QIDQ2989271FDOQ2989271
Gennian Ge, Fei Gao, Yiting Yang
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
Cited In (13)
- New theoretical bounds and constructions of permutation codes under block permutation metric
- Constructing permutation arrays from groups
- A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
- Improved lower bounds for permutation arrays using permutation rational functions
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- Constructing permutation arrays using partition and extension
- A note on good permutation codes from Reed-Solomon codes
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- A lower bound on permutation codes of distance \(n-1\)
- New upper bounds for the size of permutation codes via linear programming
- New nonexistence results on perfect permutation codes under the Hamming metric
- Extending permutation arrays: improving MOLS bounds
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)
