Class of generalized Goppa codes perfect in weighted Hamming metric

DOI10.1007/s10623-012-9739-6zbMath1294.94102arXiv1005.1524OpenAlexW1972227403MaRDI QIDQ1934222

Sergei V. Bezzateev, Natalia A. Shekhunova

Publication date: 28 January 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1524

zbMATH Keywords

perfect codesGoppa codesweighted Hamming metricgeneralized \((L, G)\) codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (4)

Binary generalized \((L,G)\) codes that are perfect in a weighted Hamming metric ⋮ AG codes, \(t\)-designs and partition sets ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ Weighted Hamming metric structures

Uses Software

• Code Tables

Cites Work

• Cyclic (L,g)-codes
• A subclass of binary Goppa codes with improved estimation of the code dimension
• Nonuniform Error Correction Using Low-Density Parity-Check Codes
• Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns
• Encyclopedia of Distances
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Class of generalized Goppa codes perfect in weighted Hamming metric