A note on upper bounds for minimum distance codes
From MaRDI portal
Cited in
(11)- Optimal codes, n-arcs and Laguerre geometry
- Slight improvements of the Singleton bound
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Large Hermitian hull GRS codes of any given length
- Pooled Testing for COVID-19 Using Coding Theory
- AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
- Divisibility of Griesmer codes
This page was built for publication: A note on upper bounds for minimum distance codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3259316)
