Results 151 to 160 of about 33,515 (176)
Some of the next articles are maybe not open access.
1999
In December of 1958 I. S. Reed and G. Solomon finished the report, entitled “polynomial codes over certain finite fields” at the M.I.T Lincoln Laboratory [1]. In 1960, a slight modification of this report was published as a paper [2] in the Journal of the Society for Industrial and Applied Mathematics(SIAM).
Irving S. Reed, Xuemin Chen
openaire +2 more sources
In December of 1958 I. S. Reed and G. Solomon finished the report, entitled “polynomial codes over certain finite fields” at the M.I.T Lincoln Laboratory [1]. In 1960, a slight modification of this report was published as a paper [2] in the Journal of the Society for Industrial and Applied Mathematics(SIAM).
Irving S. Reed, Xuemin Chen
openaire +2 more sources
Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
Reed-Solomon codes over GF(p/sup m/), p a prime and m a positive integer, are cyclic maximum distance separable (MDS) and of length p/sup m/-1. The additive group of GF(p/sup m/) is elementary abelian of type (1,1,...,1), isomorphic to a direct product of m cyclic groups of order p, denoted by C/sub p//sup m/. This paper deals with MDS codes over C/sub
A.A. Zain, B.S. Rajan
openaire +1 more source
Reed-Solomon codes over GF(p/sup m/), p a prime and m a positive integer, are cyclic maximum distance separable (MDS) and of length p/sup m/-1. The additive group of GF(p/sup m/) is elementary abelian of type (1,1,...,1), isomorphic to a direct product of m cyclic groups of order p, denoted by C/sub p//sup m/. This paper deals with MDS codes over C/sub
A.A. Zain, B.S. Rajan
openaire +1 more source
1994
The purpose of this chapter is to give an overview of Reed-Solomon (RS) codes [67] as an important subclass of nonbinary Bose-Chaudhuri-Hocquenghem (BCH) codes. Our aim is in this chapter to cover the background which is required for the forthcoming sections related to RS codes.
S. Hamidreza Jamali, Tho Le-Ngoc
openaire +1 more source
The purpose of this chapter is to give an overview of Reed-Solomon (RS) codes [67] as an important subclass of nonbinary Bose-Chaudhuri-Hocquenghem (BCH) codes. Our aim is in this chapter to cover the background which is required for the forthcoming sections related to RS codes.
S. Hamidreza Jamali, Tho Le-Ngoc
openaire +1 more source
2001
So far, we’ve looked at bit-oriented error correcting schemes. Reed-Solomon (RS) codes, however, are symbol-based. In other words, bits are combined into symbols upon which the coding is performed. RS codes are a special example of a more general class of block codes called BCH codes after Bose, Chaudhuri and Hocquenghem, forefathers of the theory ...
openaire +1 more source
So far, we’ve looked at bit-oriented error correcting schemes. Reed-Solomon (RS) codes, however, are symbol-based. In other words, bits are combined into symbols upon which the coding is performed. RS codes are a special example of a more general class of block codes called BCH codes after Bose, Chaudhuri and Hocquenghem, forefathers of the theory ...
openaire +1 more source
Reed-Solomon convolutional codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.
Gluesing-Luerssen, H, Schmale, W
openaire +2 more sources
2003
Die Reed-Solomon-Codes (RS-Codes) sind eine besonders wichtige Klasse von linearen Codes, die haufig in der Praxis benutzt werden. Thematisch gehoren sie eigentlich als eine spezielle Form der BCH-Codes in Kapitel 3. Wegen ihrer grosen praktischen Bedeutung wollen wir ihnen jedoch ein eigenes Kapitel widmen.
openaire +2 more sources
Die Reed-Solomon-Codes (RS-Codes) sind eine besonders wichtige Klasse von linearen Codes, die haufig in der Praxis benutzt werden. Thematisch gehoren sie eigentlich als eine spezielle Form der BCH-Codes in Kapitel 3. Wegen ihrer grosen praktischen Bedeutung wollen wir ihnen jedoch ein eigenes Kapitel widmen.
openaire +2 more sources
2019
In this chapter, we will give information about Reed-Solomon codes. These codes fall into the category of nonbinary cyclic codes. The generator polynomials of Reed-Solomon codes are constructed using the minimal polynomials of the extended finite fields. Reed-Solomon codes are effective for burst errors and they are used for erasure decoding.
openaire +1 more source
In this chapter, we will give information about Reed-Solomon codes. These codes fall into the category of nonbinary cyclic codes. The generator polynomials of Reed-Solomon codes are constructed using the minimal polynomials of the extended finite fields. Reed-Solomon codes are effective for burst errors and they are used for erasure decoding.
openaire +1 more source
Asymmetric quantum Reed-Solomon and generalized Reed-Solomon codes
Quantum Information Processing, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Systematic modified Reed-Solomon codes
GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, 2002Systematic m-bit symbol codes are constructed by modifying (m+/spl tau/)-bit symbol Reed-Solomon (RS) codes. These new codes are called systematic modified Reed-Solomon (SMRS) codes and have code length that far exceeds 2/sup m/, the length of m-bit RS codes. Although the systematic encoding of an SMRS code is slightly more complicated then that of the
null Lih-Jyh Weng +2 more
openaire +1 more source
Chinese Annals of Mathematics, Series B, 2010
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. This two-part paper addresses this problem. In the first part, the author improves known upper bounds for the error distance of a received word to a Reed-Solomon code over \(\text{GF}(q)\).
openaire +1 more source
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. This two-part paper addresses this problem. In the first part, the author improves known upper bounds for the error distance of a received word to a Reed-Solomon code over \(\text{GF}(q)\).
openaire +1 more source