Name
Abstract | ||
|---|---|---|
We present a class of algorithms for encoding data in memories with stuck cells. These algorithms rely on earlier code constructions termed cyclic Partitioned Linear Block Codes. For the corresponding q-ary BCH-like codes for u stucks in a codeword of length n, our encoding algorithm has complexity O((u log(q) n)(2)) F(q) operations, which we will show compares favorably to a generic approach based on Gaussian elimination. The computational complexity improvements are realized by taking advantage of the algebraic structure of cyclic codes for stucks. The algorithms are also applicable to cyclic codes for both stucks and errors. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISIT.2010.5513786 | 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY |
Keywords | Field | DocType |
computational complexity,memories,galois fields,block codes,generators,algebraic structure,convolutional codes,gaussian elimination,decoding,codeword,cyclic code,switches,polynomials,encoding,bch codes,gaussian processes,construction industry | Discrete mathematics,Polynomial,Computer science,Block code,Algorithm,BCH code,Code word,Linear code,Decoding methods,Gaussian elimination,Computational complexity theory | Conference |
Citations | PageRank | References |
10 | 0.87 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luis Alfonso Lastras-Montaño | 1 | 276 | 14.48 |
| Ashish Jagmohan | 2 | 428 | 36.12 |
| Michele Franceschini | 3 | 734 | 38.32 |