Design Methods for Maximum Minimum-Distance Error-Correcting Codes
From MaRDI portal
Publication:3268561
DOI10.1147/rd.41.0043zbMath0092.34004OpenAlexW2070325307MaRDI QIDQ3268561
Publication date: 1960
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.41.0043
Related Items (17)
An improvement of the Griesmer bound for some small minimum distances ⋮ Complete weight enumerator of torsion codes ⋮ Locality of optimal binary codes ⋮ FEW-WEIGHT CODES FROM TRACE CODES OVER ⋮ Algebraic theory of block codes detecting independent errors ⋮ An error correcting code and its implementation† ⋮ Unnamed Item ⋮ Complete weight enumerators of two classes of linear codes ⋮ A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances ⋮ Several new classes of linear codes with few weights ⋮ Partial permutation decoding for MacDonald codes ⋮ Binary and ternary LCD codes from projective spaces ⋮ On generalized MacDonald codes ⋮ A survey on proper codes ⋮ On the Construction of Binary Optimal LCD Codes with Short Length ⋮ On the covering radius of Simplex codes ⋮ MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
This page was built for publication: Design Methods for Maximum Minimum-Distance Error-Correcting Codes
