Adding a parity-check bit
From MaRDI portal
Publication:4503616
DOI10.1109/18.850691zbMath0997.94021OpenAlexW2147692972MaRDI QIDQ4503616
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850691
Related Items (13)
Extension theorems for linear codes over finite fields ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ Some improvements to the extendability of ternary linear codes ⋮ Constructing linear codes from some orbits of projectivities ⋮ Extendability of quaternary linear codes ⋮ Extendability of ternary linear codes ⋮ \((l,s)\)-extension of linear codes ⋮ A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\) ⋮ Extendability of 3-weight (mod \(q\)) linear codes over \(\mathbb F_q\) ⋮ Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\) ⋮ Goppa-like bounds for the generalized Feng-Rao distances. ⋮ Unnamed Item ⋮ A new extension theorem for linear codes
This page was built for publication: Adding a parity-check bit
