Results 221 to 230 of about 390,939 (260)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Theory, 1965
A new class of cyclic codes, cyclic product codes, is characterized. These codes enjoy the implementation advantages of cyclic codes and, in addition, possess the important structural properties of product (iterated) codes. The main results are as follows: \begin{enumerate} \item Conditions are given which ensure that the product of two, and, hence ...
H. C. Burton, Edward J. Weldon Jr.
openaire +1 more source
A new class of cyclic codes, cyclic product codes, is characterized. These codes enjoy the implementation advantages of cyclic codes and, in addition, possess the important structural properties of product (iterated) codes. The main results are as follows: \begin{enumerate} \item Conditions are given which ensure that the product of two, and, hence ...
H. C. Burton, Edward J. Weldon Jr.
openaire +1 more source
IEEE Transactions on Information Theory, 1984
Summary: By modifying product codes, a new coding scheme and its decoding method are proposed. Compared to a product code A, the first stage code \(A_ 1\) of the new code \(A_ M\) is constructed in the same way as that of the code A except that it has at least one subcode, while the second stage codes \(A_ 2^{(j)}\) of the code \(A_ M\) are a set of ...
Shigeichi Hirasawa +3 more
openaire +2 more sources
Summary: By modifying product codes, a new coding scheme and its decoding method are proposed. Compared to a product code A, the first stage code \(A_ 1\) of the new code \(A_ M\) is constructed in the same way as that of the code A except that it has at least one subcode, while the second stage codes \(A_ 2^{(j)}\) of the code \(A_ M\) are a set of ...
Shigeichi Hirasawa +3 more
openaire +2 more sources
2015 Information Theory and Applications Workshop (ITA), 2015
Product codes were introduced by Elias in 1954 and generalized by Tanner in 1981. Recently, a number of generalized product codes have been proposed for forward error-correction in high-speed optical communication. In practice, these codes are decoded by iteratively decoding each of the component codes.
Henry D. Pfister +2 more
openaire +1 more source
Product codes were introduced by Elias in 1954 and generalized by Tanner in 1981. Recently, a number of generalized product codes have been proposed for forward error-correction in high-speed optical communication. In practice, these codes are decoded by iteratively decoding each of the component codes.
Henry D. Pfister +2 more
openaire +1 more source
2010 7th IEEE Consumer Communications and Networking Conference, 2010
Network coding is a useful tool to increase the multicast capacity of networks. The traditional approach to network coding involving XOR operation has several limitations such as low robustness and can support only two users/packets at a time, per relay, in the mixing process to achieve optimal error performance.
Bilal Zafar 0001 +2 more
openaire +1 more source
Network coding is a useful tool to increase the multicast capacity of networks. The traditional approach to network coding involving XOR operation has several limitations such as low robustness and can support only two users/packets at a time, per relay, in the mixing process to achieve optimal error performance.
Bilal Zafar 0001 +2 more
openaire +1 more source
Product Code With Integrated Interleaved Component Codes
IEEE Communications LettersQin Huang
exaly +2 more sources
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
Lattice-based construction of codes is of theoretical as well as practical importance in particular for communications over bandwidth-limited channels. We investigate the so called product lattice construction. Certain fundamental properties of product lattices are derived, and it is demonstrated that their performance are comparable to those of known ...
Amir J. Salomon, Ofer Amrani
openaire +1 more source
Lattice-based construction of codes is of theoretical as well as practical importance in particular for communications over bandwidth-limited channels. We investigate the so called product lattice construction. Certain fundamental properties of product lattices are derived, and it is demonstrated that their performance are comparable to those of known ...
Amir J. Salomon, Ofer Amrani
openaire +1 more source
On the Weight Hierarchy of Product Codes
Designs, Codes and Cryptography, 2004In this paper the generalization of a formula concerning to product codes with more than two components is given. Especially the generalization of the Wei-Yang formula to the product codes with an arbitrary number of components is given and proven. This is done by using some definitions, theorems, propositions and an example.
Conchita Martínez-Pérez +1 more
openaire +1 more source
Improved Code Shortening for Block and Product Codes
2006 IEEE 63rd Vehicular Technology Conference, 2006Code shortening is commonly performed in practice but its analytical decoding performance is not well understood. In this letter, we present tight bounds for estimating the weight enumerator and hence BER (bit error rate) performance of linear shortened and shortened-extended block/product codes operating in AWGN and Rayleigh fading channels.
Kai Ching Lim, Yong Liang Guan 0001
openaire +1 more source
On products of graphs for LDPC codes
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), 2004The notion of product block codes, whose generator matrix is the tensor product of the constituent generator matrices, is well established. Typically, they have good performance and a decoding algorithm with complexity on the order of the complexity of the decoding algorithms of the constituent codes.
Jun Xu 0004, Shu Lin 0001, Ian F. Blake
openaire +1 more source
Weight hierarchy of a product code
IEEE Transactions on Information Theory, 1995The authors give formulas for the computation of the first few members of the weight hierarchy of a product code. They also present basic patterns for the supports of subcodes in which the minimum cardinalities can be found. Based on this the formula for each term of the hierarchy can be found but the required proofs are slightly involved (the formulas
Angela I. Barbero, Juan Tena
openaire +2 more sources