Constructions and bounds on linear error-block codes
From MaRDI portal
Publication:1008949
DOI10.1007/S10623-007-9119-9zbMATH Open1178.94228OpenAlexW2139696556MaRDI QIDQ1008949FDOQ1008949
Authors: San Ling, Ferruh Özbudak 
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
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Orthogonal arrays. Theory and applications
- Algebraic-geometric codes and asymptotic problems
- Rational points on curves over finite fields. Theory and Applications
- Title not available (Why is that?)
- Point sets and sequences with small discrepancy
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- An explicit tower of function fields over cubic finite fields and Zink’s lower bound
- Codes with a poset metric
- A generalization of algebraic-geometry codes
- Linear error-block codes
- Projective systems and perfect codes with a poset metric.
Cited In (9)
- Perfect, Hamming and simplex linear error-block codes with minimum \(\pi\)-distance 3
- Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
- Approximation of bounds on mixed-level orthogonal arrays
- New families of perfect linear error-block codes
- Linear error-block codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Constructions and bounds on linear error-block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008949)
