New minimum distance bounds for linear codes over small fields
From MaRDI portal
Recommendations
Cited in
(13)- Classification and nonexistence results for linear codes with prescribed minimum distances
- scientific article; zbMATH DE number 2188463 (Why is no real title available?)
- scientific article; zbMATH DE number 2104815 (Why is no real title available?)
- scientific article; zbMATH DE number 2154114 (Why is no real title available?)
- Symmetry codes over GF(3)
- scientific article; zbMATH DE number 4187709 (Why is no real title available?)
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- New linear codes over \(\mathbb{F}_3\) and \(\mathbb{F}_5\) and improvements on bounds
- A class of quaternary linear codes improving known minimum distances
- Some high-rate linear codes over \(\text{GF}(5)\) and \(\text{GF}(7)\)
- scientific article; zbMATH DE number 51008 (Why is no real title available?)
- Minimum distance bounds for linear codes over \(\text{GF}(7)\)
- An analysis of Chen's construction of minimum-distance five codes
This page was built for publication: New minimum distance bounds for linear codes over small fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812379)