Download:
|
by Osnat Keren, Simon Litsyn
Trans. on Information Theory
http://www.eng.tau.ac.il/~litsyn/papers/phsbrr.ps
Add To MetaCart
Abstract:
We introduce a family of binary array codes of size t2n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF(2 t) they are MDS. The length of the codes is n =
Citations
|
2003
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
291
|
Theory and Practice of Error Control Codes
– Blahut
- 1983
|
|
82
|
Computational Complexity of Algebraic and Numeric Problems
– Borodin, Munro
- 1975
|
|
18
|
New array codes for multiple phased burst correction
– Blaum, Roth
- 1993
|
|
17
|
Computational and Algorithmic Problems in Finite Fields
– Shparlinski
- 1992
|
|
15
|
On Decoding BCH Codes
– Forney
- 1965
|
|
5
|
A general class of maximal codes for computer applications
– Hong, Patel
- 1972
|
|
5
|
Adaptive cross parity code for a high density magnetic tape subsystem
– Patel
- 1985
|
|
4
|
of Vandermonde matrices
– Parker
- 1964
|
|
3
|
Tilborg, Multiple burstcorrecting array codes
– Blaum, Farrell, et al.
- 1988
|
|
3
|
Using redundancy to speed up disk arrays
– Cohn, Stevenson
- 1994
|
|
2
|
Burst-error-correcting array codes, Radio Elect
– Farrell, Hopkins
- 1982
|
|
2
|
Codes for error correcting in high speed memory system. Pt.II: Correction of temporary and catastrophic errors
– Srinivasan
- 1971
|
|
2
|
Codes with minimal density of checks for correcting erroneous bytes, erasures and defects
– Zaitsev, Zinoviev, et al.
- 1983
|
