\((l,s)\)-extension of linear codes

DOI10.1016/j.disc.2007.12.028zbMath1158.94006arXivcs/0701112OpenAlexW1987545156MaRDI QIDQ998537

Axel Kohnert

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0701112

zbMATH Keywords

linear codesminimum weightDiophantine system of equationsextendable codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear Diophantine equations (11D04)

Related Items (4)

Extension theorems for linear codes over finite fields ⋮ New code equivalence based on relative generalized Hamming weights ⋮ New sufficient conditions for the extendability of quaternary linear codes ⋮ A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of some optimal ternary linear codes of small length
• Some new results on optimal codes over \(\mathbb F_5\)
• Extendability of quaternary linear codes
• Extendability of ternary linear codes
• An extension theorem for linear codes
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• A new extension theorem for linear codes
• Construction of Linear Codes With Large Minimum Distance
• Optimal Linear Codes From Matrix Groups
• The intractability of computing the minimum distance of a code
• Adding a parity-check bit
• Introduction to Coding Theory
• On the extendability of linear codes

This page was built for publication: \((l,s)\)-extension of linear codes