Homogenization of binary linear codes and their applications
From MaRDI portal
Cites work
- Construction of binary self-orthogonal codes
- Construction of minimal linear codes from multi-variable functions
- Coset codes. II. Binary lattices and related codes
- Covering arrays and intersecting codes
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Fundamentals of Error-Correcting Codes
- Good quantum error-correcting codes exist
- Infinite families of few weight optimal binary linear codes from multivariable functions
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Linear codes from simplicial complexes
- Maximum-likelihood soft decision decoding of BCH codes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Multiple-particle interference and quantum error correction
- New constructions of optimal linear codes from simplicial complexes
- Optimal binary few-weight codes using a mixed alphabet ring and simplicial complexes
- Optimal Few-Weight Codes From Simplicial Complexes
- Quantum error correction via codes over GF(4)
- Simple quantum error-correcting codes
- The Extended Codes of Some Linear Codes
- Three families of self-orthogonal codes and their application in optimal quantum codes
- Trellis complexity and pseudoredundancy of relative two-weight codes
This page was built for publication: Homogenization of binary linear codes and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008092)