Divisibility of Griesmer codes
From MaRDI portal
Cites work
- A Bound for Error-Correcting Codes
- A geometric approach to classifying Griesmer codes
- A note on upper bounds for minimum distance codes
- A sequence of unique quaternary Griesmer codes
- Algebraically punctured cyclic codes
- Characters and the equivalence of codes
- Codes and projective multisets
- Congruences for sums of binomial coefficients
- Divisibility of codes meeting the Griesmer bound
- Divisible codes
- Further results on the semilinear equivalence of linear codes
- scientific article; zbMATH DE number 3880803 (Why is no real title available?)
- scientific article; zbMATH DE number 41062 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1767697 (Why is no real title available?)
- scientific article; zbMATH DE number 1795249 (Why is no real title available?)
- scientific article; zbMATH DE number 822205 (Why is no real title available?)
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- Maximum distance<tex>q</tex>-nary codes
- Minimum block length of a linear q-ary code with specified dimension and code distance
- Minimum possible block length of a linear binary code for some distances
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- On the sum \(\sum_{k\equiv r\pmod m}{n\choose k}\) and related congruences.
- The nonexistence of some ternary linear codes of dimension 6
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
- Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen.
- Weight polarization and divisibility
- Zeroes of Polynomials Over Finite Fields
This page was built for publication: Divisibility of Griesmer codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314604)
