default search action
Julia Lieb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Zita Abreu, Julia Lieb
, Raquel Pinto
Criteria for the construction of MDS convolutional codes with good column distances. Adv. Math. Commun. 18(2): 595-613 (2024) - [j10]Sebastian Heri
Self-Dual Convolutional Codes. IEEE Trans. Inf. Theory 70(2): 950-963 (2024) - [c4]Zita Abreu, Julia Lieb, Michael Schaller:
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes. ISIT 2024: 1985-1990 - [i20]Zita Abreu, Julia Lieb, Michael Schaller:
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes. CoRR abs/2402.01279 (2024) - [i19]Niklas Gassner, Julia Lieb, Abhinaba Mazumder
Information-Set Decoding for Convolutional Codes. CoRR abs/2408.07621 (2024) - 2023
- [j9]Gianira N. Alfarano, Anina Gruica, Julia Lieb
Convolutional codes over finite chain rings, MDP codes and their characterization. Adv. Math. Commun. 17(1): 1-22 (2023) - [j8]Julia Lieb
A decoding algorithm for 2D convolutional codes over the erasure channel. Adv. Math. Commun. 17(4): 935-959 (2023) - [c3]Zita Abreu, Julia Lieb
Binary convolutional codes with optimal column distances. ISIT 2023: 1271-1276 - [i18]Zita Abreu, Julia Lieb, Raquel Pinto, Joachim Rosenthal:
Criteria for the construction of MDS convolutional codes with good column distances. CoRR abs/2305.04647 (2023) - [i17]Zita Abreu, Julia Lieb, Joachim Rosenthal:
Binary convolutional codes with optimal column distances. CoRR abs/2305.04693 (2023) - 2022
- [i16]Julia Lieb, Simran Tinani:
A Number Theoretic Approach to Cycles in LDPC Codes. CoRR abs/2201.11112 (2022) - [i15]Sebastian Heri, Julia Lieb, Joachim Rosenthal:
Self-Dual Convolutional Codes. CoRR abs/2208.04087 (2022) - 2021
- [j7]Gianira N. Alfarano
Construction of LDPC convolutional codes via difference triangle sets. Des. Codes Cryptogr. 89(10): 2235-2254 (2021) - [j6]Julia Lieb
List decoding of convolutional codes over integer residue rings. Finite Fields Their Appl. 72: 101815 (2021) - [j5]Julia Lieb
Erasure decoding of convolutional codes using first-order representations. Math. Control. Signals Syst. 33(3): 499-513 (2021) - [i14]Gianira N. Alfarano, Anina Gruica, Julia Lieb, Joachim Rosenthal:
Convolutional codes over finite chain rings, MDP codes and their characterization. CoRR abs/2104.09486 (2021) - 2020
- [j4]Paulo José Fernandes Almeida
Complete j-MDP Convolutional Codes. IEEE Trans. Inf. Theory 66(12): 7348-7359 (2020) - [c2]Gianira Nicoletta Alfarano
Construction of Rate (n - 1 )/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets. ISIT 2020: 138-143 - [i13]Gianira N. Alfarano, Julia Lieb, Joachim Rosenthal:
Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets. CoRR abs/2001.07969 (2020) - [i12]Julia Lieb, Raquel Pinto, Joachim Rosenthal:
Convolutional Codes. CoRR abs/2001.08281 (2020) - [i11]Gianira N. Alfarano, Julia Lieb:
A simplified criterion for MDP convolutional codes. CoRR abs/2003.07322 (2020) - [i10]Julia Lieb, Raquel Pinto:
A decoding algorithm for 2D convolutional codes over the erasure channel. CoRR abs/2006.10527 (2020) - [i9]Julia Lieb, Diego Napp, Raquel Pinto:
List decoding of Convolutional Codes over integer residue rings. CoRR abs/2006.11245 (2020) - [i8]Julia Lieb, Joachim Rosenthal:
Erasure decoding of convolutional codes using first order representations. CoRR abs/2008.09013 (2020) - [i7]Gianira N. Alfarano, Julia Lieb, Joachim Rosenthal:
Construction of LDPC convolutional codes via difference triangle sets. CoRR abs/2008.13470 (2020)
2010 – 2019
- 2019
- [j3]Julia Lieb
Necessary field size and probability for MDP and complete MDP convolutional codes. Des. Codes Cryptogr. 87(12): 3019-3043 (2019) - [i6]Julia Lieb, Raquel Pinto:
Constructions of MDS convolutional codes using superregular matrices. CoRR abs/1903.10986 (2019) - [i5]Julia Lieb, Diego Napp, Raquel Pinto:
Robust low-delay Streaming PIR using convolutional codes. CoRR abs/1911.01316 (2019) - [i4]Paulo José Fernandes Almeida, Julia Lieb:
Constructions of (2, 1, 2) complete j-MDP convolutional codes. CoRR abs/1912.00184 (2019) - 2018
- [i3]Julia Lieb:
Necessary Field Size and Probability for MDP and Complete MDP Convolutional Codes. CoRR abs/1808.03074 (2018) - 2017
- [j2]Julia Lieb
The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes. Math. Control. Signals Syst. 29(2): 8:1-8:39 (2017) - [i2]Julia Lieb:
Complete MDP convolutional codes. CoRR abs/1712.08767 (2017) - 2016
- [j1]Uwe Helmke, Jens Jordan, Julia Lieb
Probability estimates for reachability of linear systems defined over finite fields. Adv. Math. Commun. 10(1): 63-78 (2016) - [i1]Julia Lieb:
The Probability of Reachability for a Parallel Connected Linear System over a Finite Field, Calculated by a Formula for the Number of Mutually Left Coprime Polynomial Matrices. CoRR abs/1609.02310 (2016) - 2014
- [c1]Uwe Helmke, Jens Jordan, Julia Lieb:
Reachability of Random Linear Systems over Finite Fields. ICMCTA 2014: 217-225
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: