default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnina Gruica
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i14]Peter Beelen, Roni Con, Anina Gruica, Maria Montanucci, Eitan Yaakobi:
Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-1/2 Codes. CoRR abs/2501.11371 (2025)- [i13]Avital Boruchovsky, Ohad Elishco, Ryan Gabrys, Anina Gruica, Itzhak Tamo, Eitan Yaakobi:
Making it to First: The Random Access Problem in DNA Storage. CoRR abs/2501.12274 (2025) - 2024
- [j4]Anina Gruica, Anna-Lena Horlemann, Alberto Ravagnani, Nadja Willenborg
:
Densities of codes of various linearity degrees in translation-invariant metric spaces. Des. Codes Cryptogr. 92(3): 609-637 (2024) - [c4]Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi:
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs. ISIT 2024: 452-457 - [c3]Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani, Eitan Yaakobi:
A Combinatorial Perspective on Random Access Efficiency for DNA Storage. ISIT 2024: 675-680 - [i12]Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani, Eitan Yaakobi:
Reducing Coverage Depth in DNA Storage: A Combinatorial Perspective on Random Access Efficiency. CoRR abs/2401.15722 (2024) - [i11]Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi:
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs. CoRR abs/2401.15733 (2024) - [i10]Anina Gruica, Maria Montanucci, Ferdinando Zullo:
The Geometry of Codes for Random Access in DNA Storage. CoRR abs/2411.08924 (2024) - 2023
- [j3]Gianira N. Alfarano, Anina Gruica, Julia Lieb, Joachim Rosenthal:
Convolutional codes over finite chain rings, MDP codes and their characterization. Adv. Math. Commun. 17(1): 1-22 (2023) - [j2]Anina Gruica, Alberto Ravagnani, John Sheekey, Ferdinando Zullo:
Rank-Metric Codes, Semifields, and the Average Critical Problem. SIAM J. Discret. Math. 37(2): 1079-1117 (2023) - [c2]Anina Gruica, Benjamin Jany, Alberto Ravagnani:
Duality and LP Bounds for Codes with Locality. ITW 2023: 347-352 - [i9]Anina Gruica, Benjamin Jany, Alberto Ravagnani:
LRCs: Duality, LP Bounds, and Field Size. CoRR abs/2309.03676 (2023) - [i8]Anina Gruica, Altan Berdan Kilic, Alberto Ravagnani:
Rank-Metric Codes and Their Parameters. CoRR abs/2312.06282 (2023) - 2022
- [j1]Anina Gruica, Alberto Ravagnani:
Common Complements of Linear Subspaces and the Sparseness of MRD Codes. SIAM J. Appl. Algebra Geom. 6(2): 79-110 (2022) - [i7]Anina Gruica, Alberto Ravagnani, John Sheekey, Ferdinando Zullo:
Rank-Metric Codes, Semifields, and the Average Critical Problem. CoRR abs/2201.07193 (2022) - [i6]Anina Gruica, Anna-Lena Horlemann, Alberto Ravagnani, Nadja Willenborg:
Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces. CoRR abs/2208.10573 (2022) - [i5]Anina Gruica, Alberto Ravagnani:
Rook Theory of the Etzion-Silberstein Conjecture. CoRR abs/2209.05114 (2022) - [i4]Anina Gruica, Benjamin Jany, Alberto Ravagnani:
Duality and LP Bounds for Codes with Locality. CoRR abs/2212.07805 (2022) - 2021
- [c1]Anina Gruica, Alberto Ravagnani:
The Typical Non-Linear Code over Large Alphabets. ITW 2021: 1-6 - [i3]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) - [i2]Anina Gruica, Alberto Ravagnani:
The Typical Non-Linear Code over Large Alphabets. CoRR abs/2105.04378 (2021) - 2020
- [i1]Anina Gruica, Alberto Ravagnani:
Common Complements of Linear Subspaces and the Sparseness of MRD Codes. CoRR abs/2011.02993 (2020)
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 2025-02-26 21:44 CET 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:
