Constructions and bounds on linear error-block codes

DOI10.1007/s10623-007-9119-9zbMath1178.94228OpenAlexW2139696556MaRDI QIDQ1008949

Ferruh Özbudak, San Ling

Publication date: 31 March 2009

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

Full work available at URL: https://hdl.handle.net/10356/96410

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (2)

Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Approximation of bounds on mixed-level orthogonal arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Linear error-block codes
• Algebraic-geometric codes and asymptotic problems
• Orthogonal arrays. Theory and applications
• Projective systems and perfect codes with a poset metric.
• Codes with a poset metric
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• A generalization of algebraic-geometry codes
• An explicit tower of function fields over cubic finite fields and Zink’s lower bound

This page was built for publication: Constructions and bounds on linear error-block codes