Optimal linear codes from matrix groups

Authors:
M. Braun;A. Kohnert;A. Wassermann
Affiliations:
Dept. for IT Security, Siemens AG, Munich, Germany;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 5

Constructing two-weight codes with prescribed groups of automorphisms

Discrete Applied Mathematics
Some high-rate linear codes over GF(5) and GF(7)

Problems of Information Transmission
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance

Mathematical Methods in Computer Science
Construction of binary and ternary self-orthogonal linear codes

Discrete Applied Mathematics
Efficiency analysis and derivation of enhanced deployment models for sensor networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	754.84

Visualization

Abstract

New linear codes (sometimes optimal) over the finite field with q elements are constructed. In order to do this, an equivalence between the existence of a linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations is used. To reduce the size of the system of equations, the search for solutions is restricted to solutions with special symmetry given by matrix groups. This allows to find more than 400 new codes for the case q=2,3,4,5,7,9.