Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Julia Lieb"'
Autor:
Julia Lieb
Publikováno v:
Advances in Mathematics of Communications. 17:1-22
Publikováno v:
Designs, Codes, and Cryptography
In this paper, a construction of $(n,k,\delta)$ LDPC convolutional codes over arbitrary finite fields, which generalizes the work of Robinson and Bernstein and the later work of Tong is provided. The sets of integers forming a $(k,w)$-(weak) differen
Autor:
Raquel Pinto, Julia Lieb
Two-dimensional (2D) convolutional codes are a generalization of (1D) convolutional codes, which are suitable for transmission over an erasure channel. In this paper, we present a decoding algorithm for 2D convolutional codes over such a channel by r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d249d02f21c9ee04d944e173399d8ff
http://hdl.handle.net/10773/34279
http://hdl.handle.net/10773/34279
Autor:
Julia Lieb, Simran Tinani
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining a possibl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::969bc9a4227b398564d027b34cbf15a7
http://arxiv.org/abs/2201.11112
http://arxiv.org/abs/2201.11112
Autor:
Joachim Rosenthal, Julia Lieb
Publikováno v:
Mathematics of Control, Signals, and Systems
It is well known that there is a correspondence between convolutional codes and discrete-time linear systems over finite fields. In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212037ff1738d30309dd707e6c5406a6
https://www.zora.uzh.ch/id/eprint/205958/
https://www.zora.uzh.ch/id/eprint/205958/
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Maximum distance profile (MDP) convolutional codes have been proven to be very suitable for transmission over an erasure channel. In addition, the subclass of complete MDP convolutional codes has the ability to restart decoding after a burst of erasu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae7ee7726cda1311df74a7211d08fc1c
http://hdl.handle.net/10773/29926
http://hdl.handle.net/10773/29926
Autor:
Gianira N. Alfarano, Julia Lieb
Publikováno v:
Journal of Algebra and Its Applications. 20
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible for given rate and degree. There exists a well-known criterion to check whether a code is MDP using the generator or the parity-
Publikováno v:
ISIT
This paper provides a construction of non-binary LDPC convolutional codes, which generalizes the work of Robinson and Bernstein. The sets of integers forming an (n - 1,w)- difference triangle set are used as supports of the columns of rate (n — 1)/
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
A convolutional code Cover Zpr[D] is a Zpr[D]-submodule of Znpr[D] where Zpr[D] stands for the ring of polynomials with coefficients in Zpr. In this paper, we study the list decoding problem of these codes when the transmission is performed over an e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aac20a536f6bce478e962d1c64467f9f