Results 221 to 230 of about 190,937 (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.
exaly +2 more sources
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.
exaly +2 more sources
Further results on product codes
IEEE Transactions on Information Theory, 1970A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code are L_1 and L_2 -step orthogonalizable, then the product code is ( L_1 + L_2 - 1 )-step ...
W Gore
exaly +4 more sources
Nonlinear Codes: The Product Construction
IEEE Transactions on Communications, 2007The standard product construction is discussed with respect to nonlinear codes. Thus, so-called nonlinear product codes are obtained that are better than linear product codes of similar length and code rate, and at the same time, amenable for encoding/decoding.
exaly +3 more sources
Product Codes and Parallel Concatenated Product Codes
2007 IEEE Wireless Communications and Networking Conference, 2007We study the decoding of product codes and a class of parallel concatenated product codes (PCPC). PCPC improves the minimum distance while retaining the merit of low decoding complexity of turbo product codes (TPC). We prove that using the Fibonacci interleaver does help increasing the minimum distance.
T. Din Hwa Huang +3 more
openaire +1 more source
Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference, 1997
Summary: This letter presents a technique of combining multilevel coded modulation and product coding to form product modulation codes which achieve low bit error rates with reduced decoding complexity. Three multistage decoding algorithms are presented, and good codes for both the additive white Gaussian noise (AWGN) and Rayleigh fading channels have ...
Sandeep Rajpal, Shu Lin 0001
openaire +3 more sources
Summary: This letter presents a technique of combining multilevel coded modulation and product coding to form product modulation codes which achieve low bit error rates with reduced decoding complexity. Three multistage decoding algorithms are presented, and good codes for both the additive white Gaussian noise (AWGN) and Rayleigh fading channels have ...
Sandeep Rajpal, Shu Lin 0001
openaire +3 more sources
2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014
Sparse coding is a widely involved technique in computer vision. However, the expensive computational cost can hamper its applications, typically when the codebook size must be limited due to concerns on running time. In this paper, we study a special case of sparse coding in which the codebook is a Cartesian product of two subcodebooks.
Tiezheng Ge, Kaiming He, Jian Sun 0001
openaire +2 more sources
Sparse coding is a widely involved technique in computer vision. However, the expensive computational cost can hamper its applications, typically when the codebook size must be limited due to concerns on running time. In this paper, we study a special case of sparse coding in which the codebook is a Cartesian product of two subcodebooks.
Tiezheng Ge, Kaiming He, Jian Sun 0001
openaire +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
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 +2 more sources
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 +2 more sources
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