Constructions and bounds on linear error-block codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A generalization of algebraic-geometry codes
- Algebraic-geometric codes and asymptotic problems
- An explicit tower of function fields over cubic finite fields and Zink’s lower bound
- Codes with a poset metric
- Linear error-block codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Orthogonal arrays. Theory and applications
- Point sets and sequences with small discrepancy
- Projective systems and perfect codes with a poset metric.
- Rational points on curves over finite fields. Theory and Applications
Cited in
(9)- scientific article; zbMATH DE number 5759480 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4123671 (Why is no real title available?)
- scientific article; zbMATH DE number 4207992 (Why is no real title available?)
- scientific article; zbMATH DE number 2230715 (Why is no real title available?)
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)
