Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Venkiah, D. Declercq, C. Poulliat (2008)
Design of cages with a randomized progressive edge-growth algorithmIEEE Communications Letters, 12
G. Caire (1998)
Bit-interleaved coded modulationIEEE Transactions on Information Theory, 44
C. Berrou, A. Glavieux, P. Thitimajshima (1993)
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Proceedings of ICC '93 - IEEE International Conference on Communications, 2
H. Pishro-Nik, N. Rahnavard, F. Fekri (2005)
Nonuniform error correction using low-density parity-check codesIEEE Transactions on Information Theory, 51
M. Davey, D. Mackay (1998)
Low-density parity check codes over GF(q)IEEE Communications Letters, 2
Christian Schlegel, Lance Perez (2004)
Low-Density Parity-Check Codes
C. Poulliat, M. Fossorier, D. Declercq (2008)
Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary imagesIEEE Transactions on Communications, 56
Xiao-Yu Hu, E. Eleftheriou (2004)
Binary representation of cycle Tanner-graph GF(2/sup b/) codes2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 1
L. Barnault, D. Declercq (2003)
Fast Decoding Algorithm for LDPC over GF(2q)
A. Voicila, D. Declercq, F. Verdier, M. Fossorier, P. Urard (2010)
Low-complexity decoding for non-binary LDPC codes in high order fieldsIEEE Transactions on Communications, 58
G. Caire, G. Taricco, E. Biglieri (2008)
Bit-interleaved coded modulationProceedings of ICC'97 - International Conference on Communications, 3
M. Potluri (2005)
Distributed source coding using non binary LDPC
D. Mackay (1995)
Good Codes Based on Very Sparse Matrices
D. Declercq, M. Fossorier (2007)
Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$IEEE Transactions on Communications, 55
H. Wymeersch, H. Steendam, M. Moeneclaey (2004)
Log-domain decoding of LDPC codes over GF(q)2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2
R. Tanner (1981)
A recursive approach to low complexity codesIEEE Trans. Inf. Theory, 27
A. Voicila, D. Declercq, F. Verdier, M. Fossorier, P. Urard (2007)
Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes2007 IEEE International Conference on Communications
L. Ping, Raymond Leung (2000)
Decoding low density parity check codes with finite quantization bitsIEEE Communications Letters, 4
A. Voicila, François Verdier, David Declercq, M. Fossorier, P. Urard (2007)
Architecture of a low-complexity non-binary LDPC decoder for high order fields2007 International Symposium on Communications and Information Technologies
Performance of Non-Binary LDPC Codes for Next Generation Mobile Systems A new family of non-binary LDPC is presented that are based on a finite field GF(64). They may be successfully implemented in single-carrier and OFDM transmission system. Results prove that DAVINCI codes allow for improving the system performance and may be considered to be applied in the future mobile system.
International Journal of Electronics and Telecommunications – de Gruyter
Published: Jun 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.