(l,s)-extension of linear codes

DOI10.1016/J.DISC.2007.12.028zbMATH Open1158.94006arXivcs/0701112OpenAlexW1987545156MaRDI QIDQ998537FDOQ998537

Authors: Axel Kohnert 

Publication date: 28 January 2009

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

Abstract: We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary [88,8,54] code. We develop an algorithm, which starts with already good codes C, i.e. codes with high minimum distance d for given length n and dimension k over the field GF(q). The algorithm is based on the newly defined (l,s)-extension. This is a generalization of the well-known method of adding a parity bit in the case of a binary linear code of odd minimum weight. (l,s)-extension tries to extend the generator matrix of C by adding l columns with the property that at least s of the l letters added to each of the codewords of minimum weight in C are different from 0. If one finds such columns the minimum distance of the extended code is d+s provided that the second smallest weight in C was at least d+s. The question whether such columns exist can be settled using a Diophantine system of equations.

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

Recommendations

• scientific article; zbMATH DE number 2154148
• An extension theorem for linear codes
• A generalized extension theorem for linear codes
• On the extendability of linear codes
• A new extension theorem for linear codes
• Some (almost) optimally extendable linear codes
• Extension theorems for linear codes over finite fields
• Some generalizations of extension theorems for linear codes over finite fields
• On the \(l\)-extendability of quaternary linear codes
• scientific article; zbMATH DE number 2077103

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)

Cites Work

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

Cited In (8)

• The extended codes of projective two-weight codes
• Update on the Extension of Good Linear Codes
• A new extension theorem for 3-weight modulo \(q\) linear codes over \({\mathbb{F}_q}\)
• Extension theorems for linear codes over finite fields
• New code equivalence based on relative generalized Hamming weights
• On a necessary condition for L-step orthogonalization of linear codes and its applications
• Title not available (Why is that?)
• New sufficient conditions for the extendability of quaternary linear codes

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

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