Name
Abstract | ||
|---|---|---|
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F(x)/(xn 1), where F is a finite field. A particular choice of the data leads to the class of doubly-cyclic CC's. Within this large class Reed-Solomon and BCH convolu- tional codes can be defined. After constructing doubly-cyclic CC's, basic properties are derived on the basis of which distance properties of Reed-Solomon convolutional codes are investigated. This shows that some of them are optimal or near optimal with respect to distance and performance. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00200-006-0014-9 | Applicable Algebra in Engineering, Communication and Computing |
Keywords | DocType | Volume |
Convolutional coding theory,Cyclic codes,Skew polynomial rings,94B10,94B15,16S36 | Journal | math.RA/04 |
Issue | ISSN | Citations |
2 | 0938-1279 | 7 |
PageRank | References | Authors |
0.53 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heide Gluesing-Luerssen | 1 | 69 | 12.81 |
| Wiland Schmale | 2 | 13 | 2.57 |