Results 281 to 290 of about 8,529,401 (324)
Some of the next articles are maybe not open access.
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 +2 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 +2 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 +1 more source
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 +1 more source
Construction of new quantum codes via Hermitian dual-containing matrix-product codes
Quantum Information Processing, 2020Meng Cao, Jianlian Cui, Cui Jianlian
exaly +2 more sources
Entanglement-assisted quantum codes from matrix-product codes
Quantum Information Processing, 2019Xiusheng Liu, Hualu Liu, Liu Xiusheng
exaly +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
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
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
Construction of Quantum Codes From Matrix-Product Codes
IEEE Communications Letters, 2020Recently, the construction of matrix-product codes with certain self-orthogonality is an effective way to obtain good quantum codes. One of the most frequently used means in this process is to construct quasi-unitary matrices as the defining matrices of ...
semanticscholar +1 more source
Construction and decoding of matrix-product codes from nested codes
Applicable Algebra in Engineering, Communications and Computing, 2009 We consider matrix-product codes [C1 ... Cs] · A, where C1, ..., Cs are nested linear codes and matrix A has full rank. We compute their minimum distance and provide a decoding algorithm when A is a non-singular by columns matrix. The decoding algorithm
Fernando Hernando +2 more
exaly +2 more sources