Coding Schemes for Crisscross Error Patterns

Authors:
Simon Plass;Gerd Richter;A. J. Han Vinck
Affiliations:
Institute of Communications and Navigation, German Aerospace Center (DLR), Wessling, Germany 82234;Department of TAIT, Ulm University, Ulm, Germany 89081;Institute for Experimental Mathematics, University of Essen, Essen, Germany 45326
Venue:
Wireless Personal Communications: An International Journal
Year:
2008

Citing 3
Cited 0

A simple derivation of the Berlekamp-Massey algorithm and some applications

IEEE Transactions on Information Theory
Special Feature: Semiconductor Memory Reliability with Error Detecting and Correcting Codes

Computer
A welch–berlekamp like algorithm for decoding gabidulin codes

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses two coding schemes which can handle emerging errors with crisscross patterns. First, a code with maximum rank distance, so-called Rank-Codes, is described and a modified Berlekamp---Massey algorithm is provided. Secondly, a Permutation Code based coding scheme for crisscross error patterns is presented. The influence of different types of noise are also discussed.