Abstract:
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known in system theory. Our construction has already been considered in the literature in relation to other questions. The investigation of codes in this graph-based construction is inspired by analogy with classical cyclic codes that are defined in a similar way in polynomial rings. We show that all cyclic codes can be embedded in this construction. For each graph, the algorithm computes the largest number of errors which can be corrected by codes defined with this graph. In addition, it finds a generator of a code with this optimum value.
Citations
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
318
|
Finite Fields
– Lidl, Niederreiter
|
|
246
|
Introduction to Finite Fields and Their Applications
– Lidl, Niederreiter
- 1994
|
|
15
|
Compression and Coding Algorithms
– Moffat, Turpin
- 2002
|
|
9
|
Parameterized complexity after (almost) ten years: review and open questions
– Downey, Fellows
- 1999
|
|
8
|
The parametrized complexity of some fundamental problems in coding theory
– Downey, Fellows, et al.
- 1999
|
|
7
|
Handbook of Coding Theory
– Pless, Huffman
- 1998
|
|
5
|
Graph Algebras and Automata
– Kelarev
- 2003
|
|
2
|
Error-correcting codes as ideals
– Kelarev, SolĂ©
- 2000
|
|
1
|
Theory of Algorithms
– Asano, Wada, et al.
- 2003
|
|
1
|
An algorithm for computing the minimum distances of extensions of BCH codes, in preparation
– Cazaran, Kelarev, et al.
- 2006
|
|
1
|
On a theorem of Cohen and Montgomery for graded rings
– Kelarev
- 2001
|
|
1
|
Minimum distances and information rates for matrix extensions of BCH codes
– Kelarev
- 2004
|
|
1
|
Information rates and weights of codes in structural matrix rings
– Kelarev, Sokratova
- 2001
|
|
1
|
Ring Theory and Applications
– Lidl, Wiesenbauer
- 1980
|