Optimal Linear Codes From Matrix Groups

DOI10.1109/TIT.2005.859291zbMath1225.94022OpenAlexW2166904350MaRDI QIDQ3546610

Alfred Wassermann, Michael Braun, Axel Kohnert

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.859291

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Linear Diophantine equations (11D04) Combinatorial codes (94B25)

Related Items (13)

q-Analogs of Packing Designs ⋮ On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) ⋮ Affine blocking sets, three-dimensional codes and the Griesmer bound ⋮ On strongly walk regular graphs, triple sum sets and their codes ⋮ Some high-rate linear codes over \(\text{GF}(5)\) and \(\text{GF}(7)\) ⋮ On linear codes admitting large automorphism groups ⋮ On the existence of PD-sets: algorithms arising from automorphism groups of codes ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ \((l,s)\)-extension of linear codes ⋮ Construction of binary and ternary self-orthogonal linear codes ⋮ On the classification of unitals on 28 points of low rank ⋮ Update on the Extension of Good Linear Codes ⋮ Search for combinatorial objects using lattice algorithms -- revisited

This page was built for publication: Optimal Linear Codes From Matrix Groups