Upper bounds for constant weight error correcting codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3478749 (Why is no real title available?)
- Improved asymptotic bounds for error-correcting codes
- On upper bounds for unrestricted binary-error-correcting codes
- Some additional upper bounds for fixed-weight codes of specified minimum distance
- Upper bounds for fixed-weight codes of specified minimum distance (Corresp.)
Cited in
(13)- Algebraic theory of block codes detecting independent errors
- On the maximum cardinality of binary constant weight codes with prescribed distance
- The last packing number of quadruples, and cyclic SQS
- Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six
- Improved linear programming bound on sizes of doubly constant-weight codes
- Two-weight codes: upper bounds and new optimal constructions
- Asymptotic determination of the last packing number of quadruples
- Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
- The completion determination of optimal \((3,4)\)-packings
- Optimal arrangements of classical and quantum states with limited purity
- On the Construction of Multiply Constant-Weight Codes
- List decodability at small radii
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with =2
This page was built for publication: Upper bounds for constant weight error correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556310)
