Zobrazeno 1 - 10
of 191
pro vyhledávání: '"M.P.C. Fossorier"'
Autor:
M.P.C. Fossorier, N. Miladinovic
Publikováno v:
IEEE Transactions on Communications. 56:201-212
A generalized low-density parity check code (GLDPC) is a low-density parity check code in which the constraint nodes of the code graph are block codes, rather than single parity checks. In this paper, we study GLDPC codes which have BCH or Reed-Solom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e40c75a3c58d09702083a1c63c569271
https://doi.org/10.1109/tcomm.2008.041077
https://doi.org/10.1109/tcomm.2008.041077
Publikováno v:
IEEE Transactions on Information Theory. 53:4728-4737
In this paper, a general framework which enables to compare previously proposed block decoding approaches for the fast correlation attack is developed. All attacks are based on decoding using a set of parity check sums of an underlying linear code. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0437a2f1032566afd9edfcac2d89ecb6
https://doi.org/10.1109/tit.2007.909164
https://doi.org/10.1109/tit.2007.909164
Publikováno v:
Journal of Lightwave Technology. 25:2879-2886
We describe simple iterative decoders for low-density parity-check codes based on Euclidean geometries, suitable for practical very-large-scale-integration implementation in applications requiring very fast decoders. The decoders are based on shuffle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11fbbf751e3ac011c2b57984ca23b037
https://doi.org/10.1109/jlt.2007.903311
https://doi.org/10.1109/jlt.2007.903311
Publikováno v:
IEEE Transactions on Information Theory. 53:402-411
In this correspondence, iteration-1 of bit flipping decoding based on a set of nonorthogonal check sums is analyzed for both regular and irregular models. In particular, the tradeoff between the Hamming weight (and overlapping) of the check sums and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcbade8a7e7055665e71dd5d3c24d0bb
https://doi.org/10.1109/tit.2006.887515
https://doi.org/10.1109/tit.2006.887515
Autor:
Juntan Zhang, M.P.C. Fossorier
Publikováno v:
IEEE Transactions on Information Theory. 52:3168-3185
In this paper, the mean field (MF) and mixed mean field (MMF) algorithms for decoding low-density parity-check (LDPC) codes are considered. The MF principle is well established in statistical physics and artificial intelligence. Instead of using a si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e28a084c025275e7462abdcdf2de7355
https://doi.org/10.1109/tit.2006.876238
https://doi.org/10.1109/tit.2006.876238
Autor:
M.P.C. Fossorier, Ikuo Oka
Publikováno v:
IEEE Transactions on Communications. 54:7-12
In this letter, a general orthogonal-modulation model to develop new modulations and to identify some widely used modulation schemes is proposed. Based on this general framework, an optimum scheme for non-Gaussian channels under a given set of constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8cad5be2a0a9d9a574e9b7dda1b14e9
https://doi.org/10.1109/tcomm.2005.861682
https://doi.org/10.1109/tcomm.2005.861682
Autor:
N. Miladinovic, M.P.C. Fossorier
Publikováno v:
IEEE Transactions on Information Theory. 51:1594-1606
In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec7149b1b8e392d9e1227dd9c99d8ed9
https://doi.org/10.1109/tit.2005.844095
https://doi.org/10.1109/tit.2005.844095
Autor:
M.P.C. Fossorier, A. Valembois
Publikováno v:
IEEE Transactions on Information Theory. 50:2998-3014
The main reference of this paper is the sphere-packing bound of 1967 (SP67) derived by Shannon, Gallager, and Berlekamp. It offers a lower bound on the decoding error probability over a very large variety of channels. If it has failed so far to provi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5270e921a0aff6c4bbfe691ee5b9605d
https://doi.org/10.1109/tit.2004.838090
https://doi.org/10.1109/tit.2004.838090
Autor:
M.P.C. Fossorier
Publikováno v:
IEEE Transactions on Information Theory. 50:1788-1793
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7487a2199f9e4db6860181da17c7b654
https://doi.org/10.1109/tit.2004.831841
https://doi.org/10.1109/tit.2004.831841
Autor:
Shu Lin, M.P.C. Fossorier
Publikováno v:
IEEE Transactions on Information Theory. 48:287-293
The statistical approach proposed by D. Agrawal and A. Vardy (see IEEE Trans. Inform. Theory, vol.46, pp.60-83, Jan. 2000) to evaluate the error performance of the generalized minimum distance (GMD) decoding is extended to other reliability based dec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::648edcfcbacfa8a4311150a7fa8370cf
https://doi.org/10.1109/18.971758
https://doi.org/10.1109/18.971758