Decoding Frequency Permutation Arrays Under Chebyshev Distance

DOI10.1109/TIT.2010.2069253MaRDI QIDQ5281224zbMATH OpenFDO

Authors Min-Zheng Shieh, Shi-Chun Tsai

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2010.2069253

Mathematics Subject Classification ID

Decoding (94B35)

Cited in

(5)

• Computing the ball size of frequency permutations under Chebyshev distance
• Permutation Arrays Under the Chebyshev Distance
• Move-to-front, distance coding, and inversion frequencies revisited
• Increasing the minimum distance of codes by twisting
• Equidistant frequency permutation arrays and related constant composition codes

This page was built for publication: Decoding Frequency Permutation Arrays Under Chebyshev Distance

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