An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
From MaRDI portal
Publication:2989271
DOI10.1109/TIT.2013.2237945zbMath1364.94781OpenAlexW1972398039MaRDI QIDQ2989271
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
Related Items (9)
Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Improved lower bounds for permutation arrays using permutation rational functions ⋮ Constructing permutation arrays from groups ⋮ Extending permutation arrays: improving MOLS bounds ⋮ 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
This page was built for publication: An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
