Abstract
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.
Keywords
Mathematics
Hamming code
Enumeration
Hamming distance
Hamming weight
Discrete mathematics
Diophantine equation
Upper and lower bounds
Constructive
Block code
Algorithm
Computer science
Decoding methods
Subject Areas
Coding theory and cryptography
·Artificial Intelligence ·Physical Sciences
Cooperative Communication and Network Coding
·Computer Networks and Communications ·Physical Sciences
graph theory and CDMA systems
·Electrical and Electronic Engineering ·Physical Sciences
Citations by Year
2014: 1
Loading…
Loading…