Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance

DOI10.1109/TIT.2004.834744zbMath1283.94148arXivcs/0406039OpenAlexW2169449223MaRDI QIDQ3547854

Sergey Yekhanin, I. I. Dumer

Publication date: 21 December 2008

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

Full work available at URL: https://arxiv.org/abs/cs/0406039

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (8)

Nonbinary error-correcting codes with one-time error-free feedback ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Some constructions of \((t,m,s)\)-nets with improved parameters ⋮ Almost affinely disjoint subspaces ⋮ Signature codes for noisy multiple access adder channel ⋮ The maximal probability that k‐wise independent bits are all 1 ⋮ Two-batch liar games on a general bounded channel ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces

This page was built for publication: Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance