Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Rolf Johannesson"'
Publikováno v:
IEEE Transactions on Information Theory. 62:163-183
A unified approach to search for and optimize codes determined by their sparse parity-check matrices is presented. Replacing the nonzero elements of a binary parity-check matrix (the base or parent matrix) either by circulants or by companion matrice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d4d52b577bf46664ec8fa77e1816108
https://doi.org/10.1109/tit.2015.2496213
https://doi.org/10.1109/tit.2015.2496213
Autor:
Rolf Johannesson, Kamil Sh. Zigangirov
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field Two new chapters on low-density parity-check (LDPC) convolutional
Publikováno v:
Problems of Information Transmission; 47(1), pp 1-14 (2011)
Constructions of woven graph codes based on constituent convolutional codes are studied and examples of woven convolutional graph codes are presented. The existence of codes, satisfying the Costello lower bound on the free distance, within the random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bbde1195df30e57ef2bda42a6661b67
https://doi.org/10.1134/s0032946011010017
https://doi.org/10.1134/s0032946011010017
Publikováno v:
IEEE Transactions on Information Theory; 56(4), pp 1618-1623 (2010)
A rate R=5/20 hypergraph-based woven convolu- tional code with overall constraint length 67 and constituent con- volutional codes is presented. It is based on a 3-partite, 3-uniform, 4-regular hypergraph and contains rate R=3/4 constituent convolutio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ad3c68d58eb98f38394d22c16cd5feb
https://doi.org/10.1109/tit.2010.2040966
https://doi.org/10.1109/tit.2010.2040966
Publikováno v:
Problems of Information Transmission. 45:95-109
Ensembles of binary random LDPC block codes constructed using Hamming codes as constituent codes are studied for communicating over the binary symmetric channel. These ensembles are known to contain codes that asymptotically almost meet the Gilbert-V
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80cc2b999f4577641c5c3d81a1a8d7a5
https://doi.org/10.1134/s0032946009020021
https://doi.org/10.1134/s0032946009020021
Publikováno v:
IEEE Transactions on Information Theory. 54:1036-1049
A bidirectional efficient algorithm for searching code trees (BEAST) is proposed for efficient soft-output decoding of block codes and concatenated block codes. BEAST operates on trees corresponding to the minimal trellis of a block code and finds a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e3bc8dc701cdfd243706c0fd18971e0
https://doi.org/10.1109/tit.2007.915971
https://doi.org/10.1109/tit.2007.915971
Publikováno v:
IEEE Transactions on Information Theory. 53:361-368
An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02ad4a49718a55935ac6a8a0e10e1e0c
https://doi.org/10.1109/tit.2006.887522
https://doi.org/10.1109/tit.2006.887522
Autor:
Rolf Johannesson, Kamil Zigangirov
In this chapter, the LDPC block codes, which were invented by Robert Gallager and appeared in his thesis, are discussed. Then they are generalized to LDPC convolutional codes, which were invented by the second author and his graduate student Alberto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb224c3b3cbe0e3c3ea49354107e8ed2
https://doi.org/10.1002/9781119098799.ch8
https://doi.org/10.1002/9781119098799.ch8
Autor:
Rolf Johannesson, Kamil Zigangirov
Publikováno v:
Fundamentals of Convolutional Coding
From the Publisher: Convolutional codes, among the main error control codes, are routinely used in applications for mobile telephony, satellite communications, and voice-band modems. Written by two leading authorities in coding and information theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47ede10349260da1fcd57d79970b886b
https://doi.org/10.1002/9781119098799.fmatter
https://doi.org/10.1002/9781119098799.fmatter