Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
MacWilliams identity for codes with the rank metric
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
| Hi-index | 754.84 |
The crisscross error model in data arrays is considered, where the corrupted symbols are confined to a prescribed number of rows or columns (or both). Under the additional assumption that the corrupted entries are uniformly distributed over the channel alphabet, and by allowing a small decoding error probability, a coding scheme is presented where the redundancy can get close to one half the redundancy required in minimum-distance decoding of crisscross errors