Upper bounds for constant weight error correcting codes
From MaRDI portal
Publication:2556310
DOI10.1016/0012-365X(72)90027-1zbMath0248.94023WikidataQ127753939 ScholiaQ127753939MaRDI QIDQ2556310
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (13)
Algebraic theory of block codes detecting independent errors ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ On the Construction of Multiply Constant-Weight Codes ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ On the maximum cardinality of binary constant weight codes with prescribed distance ⋮ The completion determination of optimal \((3,4)\)-packings ⋮ Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\) ⋮ Asymptotic determination of the last packing number of quadruples ⋮ List decodability at small radii ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ The last packing number of quadruples, and cyclic SQS
Cites Work
This page was built for publication: Upper bounds for constant weight error correcting codes