A comment on the weight structure of generator matrices of linear codes

MaRDI QIDQ751624zbMATH OpenFDO

Authors Stefan Dodunekov

Publication date 1990

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Galois fieldgenerating matrixGriesmer's functionlinear code

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Linear codes (general theory) (94B05)

Review text

The author proves that for an arbitrary [n,k,d]-code over GF(q) with \(n=t+g_ q(k,d),\) \(g_ q(k,d)=\sum^{k-1}_{j=0}| d/q^ j|\) (Griesmer's function) a generating matrix of vectors with weight \(\leq d+t\) can be chosen.

Recommendations

• On binary cyclic codes of odd lengths from 101 to 127
• The weight enumerator of linear codes over \(\mathrm{GF}(q^m)\) having generator matrix over \(\mathrm{GF}(q)\)
• The degree of functions and weights in linear codes.
• Linear codes close to the Griesmer bound and the related geometric structures
• Weight functions and generalized Hamming weights of linear codes

Cited in

(9)

• Divisibility of codes meeting the Griesmer bound
• The weight enumerator of linear codes over \(\mathrm{GF}(q^m)\) having generator matrix over \(\mathrm{GF}(q)\)
• Perfect codes and balanced generalized weighing matrices. II
• On near-MDS codes
• On generator matrices and parity check matrices of generalized integer codes
• Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
• On generator Cauchy matrices of GDRS/GTRS codes
• On binary cyclic codes of odd lengths from 101 to 127
• Optimal ternary locally repairable codes

This page was built for publication: A comment on the weight structure of generator matrices of linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751624)