Burst error enumeration of m-array codes over rings and its applications
Enumerating burst errors enables to obtain bounds on parameters of codes. Recently, Jain in [5] established a Reiger's type bound for burst error correcting matrix codes over finite fields with respect to a non Hamming metric. Here, we extend these results to array codes over finite rings. Furt...
Saved in:
| Published in | European journal of pure and applied mathematics Vol. 3; no. 4; pp. 653 - 669 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
xxx
2010
|
| Online Access | Get full text |
| ISSN | 1307-5543 1307-5543 |
Cover
| Summary: | Enumerating burst errors enables to obtain bounds on parameters of codes. Recently, Jain
in [5] established a Reiger's type bound for burst error correcting matrix codes over finite fields with
respect to a non Hamming metric. Here, we extend these results to array codes over finite rings.
Further, we also introduce a new constructive method for counting burst errors that avoids solving
Diophantine inequalities in order to compute burst errors for each given weight. Finally, we apply our
results on establishing some bounds for array codes over finite rings.
2000 Mathematics Subject Classifications: 94B05, 94B20,94B25. |
|---|---|
| Bibliography: | TMUH |
| ISSN: | 1307-5543 1307-5543 |