On decoding BCH codes
From MaRDI portal
Cited in
(35)- At the dawn of the theory of codes
- Construction and decoding of BCH codes over finite commutative rings
- A sequence construction of cyclic codes over finite fields
- Constructions of cyclic quaternary constant-weight codes of weight three and distance four
- A family of optimal ternary cyclic codes with minimum distance five and their duals
- Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
- Construction and decoding of BCH codes over chain of commutative rings
- Cyclic codes from cyclotomic sequences of order four
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- A construction scheme for linear and non-linear codes
- Two families of optimal ternary cyclic codes with minimal distance four
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Several classes of optimal ternary cyclic codes with minimal distance four
- Fast BCH Syndrome Coding for Steganography
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- scientific article; zbMATH DE number 7595032 (Why is no real title available?)
- Correcting errors and erasures via the syndrome variety
- Gröbner bases over Galois rings with an application to decoding alternant codes
- A family of cyclic codes with two zeros
- Weight enumerators of some irreducible cyclic codes of odd length
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Optimal quinary negacyclic codes with minimum distance four
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
- Optimal quinary cyclic codes with three zeros
- Optimal quinary cyclic codes with three zeros
- Binary cyclic codes from three classes of sequences
- Binary duadic codes and their related codes with a square-root-like lower bound
- Twisted group algebras of abelian groups: a survey
- New results of binary cyclic codes from sparse polynomials over \(\mathbb{F}_{2^n}\)
- Oblivious ciphertext compression via linear codes
- Understanding binary-Goppa decoding
- Constructing infinite families of cyclic codes utilizing cryptographic functions over finite fields
- A note on cyclic codes from APN functions
- The decoding of extended Reed-Solomon codes
This page was built for publication: On decoding BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519678)
