Lower bound of covering radius of binary irreducible Goppa codes
From MaRDI portal
Publication:510450
DOI10.1007/s10623-015-0173-4zbMath1402.94126OpenAlexW2296005727MaRDI QIDQ510450
Sergei V. Bezzateev, Natalia A. Shekhunova
Publication date: 10 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01276223/file/wcc15-tu3-3.pdf
Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
Cyclic Generalized Separable (L, G) Codes, Totally decomposed cumulative Goppa codes with improved estimations, Lower bound of the covering radius of irreducible Goppa codes
Cites Work
- Covering radius 1985-1994
- Covering radius for long BCH codes
- Good coverings of Hamming spaces with spheres
- Binary generalized \((L,G)\) codes that are perfect in a weighted Hamming metric
- Class of generalized Goppa codes perfect in weighted Hamming metric
- Exponential Sums and Goppa Codes: I
- Covering radius---Survey and recent results
- On quasi-perfect property of double-error-correcting Goppa codes and their complete decoding
- Further results on the covering radius of codes
- Parameters of Goppa codes revisited
- The Arithmetic of Polynomials in a Galois Field
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item