Any code of which we cannot think is good

DOI10.1109/18.59944zbMath0713.94015OpenAlexW2164719123MaRDI QIDQ3199328

John T. Coffey, Rodney M. Goodman

Publication date: 1990

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

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

zbMATH Keywords

Kolmogorov complexitylinear codecoding theoryGilbert-Varshamov boundblock lengthdistance versus reduncancyrandom nonlinear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

Syntactic structures and code parameters ⋮ Algorithmic complexity of points in dynamical systems ⋮ Differential subordination and convexity criteria of integral operators

This page was built for publication: Any code of which we cannot think is good