Coset Decomposition Method for Decoding Linear Codes
نویسندگان
چکیده
We introduced an application of the decomposition of a group into cosets of a subgroup to the theory of error detecting and correcting codes. The proposed approach is based on the general method for decoding linear codes known as syndrome decoding. Mathematics Subject Classification: 20A05; 20B05; 20B40
منابع مشابه
High Performance Steganographic Scheme Applying Time-Varying Convolutional Embedding Codes
A matrix embedding code was developed as a commonly used steganographic technique in which a parity-check matrix is used to perform embedding. However, a drawback of high decoding complexity for linear block codes by using the maximum-likelihood algorithm is unrealistic. This paper proposes a simple and effective trellis embedding scheme for binary messages. Compared with a matrix embedding alg...
متن کاملOn the efficient decoding of algebraic-geometric codes
This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to find an efficient decoding algorithm for algebraic-geometric codes, the latest results give algorithms which can be explained purely in terms of linear algebra. We will treat the following subjects: 1. The decoding problem 2. Decoding by error...
متن کاملOn Step-by-Step Complete Decoding Triple-Error-Correcting Binary BCH Codes
The decoding beyond the Bose-Chaudhuri-Hocquenghem (BCH) bound is always an interesting research topic in block error correction codes. However, searching a complete decoding algorithm is not easy since all the error patterns that belong to the coset leaders of the standard array need to be correctable [1]. Both the well-known standard algebraic method and the step-by-step method can be used to...
متن کاملComputing coset leaders and leader codewords of binary codes
Communicated by [editor] In this paper we use the Gröbner representation of a binary linear code C to give efficient algorithms for computing the whole set of coset leaders, denoted by CL(C) and the set of leader codewords, denoted by L(C). The first algorithm could be adapted to provide not only the Newton and the covering radius of C but also to determine the coset leader weight distribution....
متن کاملLow-complexity trellis decoding of linear block codes - Communications, IEE Proceedings-
The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to...
متن کامل