A search algorithm for linear codes: progressive dimension growth

Authors:
Tsvetan Asamov;Nuh Aydin
Affiliations:
Department of Mathematics, Kenyon College, Gambier, USA 43022;Department of Mathematics, Kenyon College, Gambier, USA 43022
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 8
Cited 0

The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes

Designs, Codes and Cryptography
Algebraic-Geometric Codes

Algebraic-Geometric Codes
Discovering Mathematics with Magma: Reducing the Abstract to the Concrete (Algorithms and Computation in Mathematics)

Discovering Mathematics with Magma: Reducing the Abstract to the Concrete (Algorithms and Computation in Mathematics)
The intractability of computing the minimum distance of a code

IEEE Transactions on Information Theory
New ternary linear codes

IEEE Transactions on Information Theory
New ternary quasi-cyclic codes with better minimum distances

IEEE Transactions on Information Theory
New quasi-twisted degenerate ternary linear codes

IEEE Transactions on Information Theory
New Quasi-Cyclic Codes From Simplex Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm, called progressive dimension growth (PDG), for the construction of linear codes with a pre-specified length and a minimum distance. A number of new linear codes over GF(5) that have been discovered via this algorithm are also presented.