Zobrazeno 1 - 10
of 221
pro vyhledávání: '"Johannesson, Rolf"'
In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric chan
Externí odkaz:
http://arxiv.org/abs/1111.3820
Autor:
Bocharova, Irina E., Hug, Florian, Johannesson, Rolf, Kudryashov, Boris D., Satyukov, Roman V.
The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representa
Externí odkaz:
http://arxiv.org/abs/1108.0840
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there
Externí odkaz:
http://arxiv.org/abs/0804.0996
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matrix G(D)=(1 1+D) when used to communicate over the binary symmetric chan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b9ea948fa646624325efaca67edc0264
http://lup.lub.lu.se/record/1978581
http://lup.lub.lu.se/record/1978581
The ensemble of regular Low-Density Parity-Check (LDPC) codes introduced by Gallager is considered. Using probabilistic arguments a lower bound on the normalized minimum distance is derived. A new code construction, called Chained Gallager codes, is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bc5c0f8a9db3862e6d414511379a0618
http://lup.lub.lu.se/record/1369522/file/1593308.pdf
http://lup.lub.lu.se/record/1369522/file/1593308.pdf
Publikováno v:
2014 IEEE International Symposium on Information Theory; 2014, p2774-2778, 5p
Publikováno v:
2014 8th International Symposium on Turbo Codes & Iterative Information Processing (ISTC); 2014, p243-248, 6p
Autor:
Johannesson, Rolf, Zigangirov, Kamil
In this paper list decoding of convolutional codes is considered. List decoding is a very powerful, low complexity, non-backtracking decoding method that does not fully exploit the error correcting capability of the code. A correct path loss is a ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2a242ec350d071eed7e2525e28c15024
http://lup.lub.lu.se/record/1148340/file/1148873.pdf
http://lup.lub.lu.se/record/1148340/file/1148873.pdf