Coded Trace Reconstruction
Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of coded trace reconstruction , the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called t...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 66; no. 10; pp. 6084 - 6103 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.10.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of coded trace reconstruction , the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called traces ) corrupted by edit errors. Codes used in current portable DNA-based storage systems with nanopore sequencers are largely based on heuristics, and have no provable robustness or performance guarantees even for an error model with i.i.d. deletions and constant deletion probability. Our work is the first step towards the design of efficient codes with provable guarantees for such systems. We consider a constant rate of i.i.d. deletions, and perform an analysis of marker-based code-constructions. This gives rise to codes with redundancy <inline-formula> <tex-math notation="LaTeX">O(n/\log n) </tex-math></inline-formula> (resp. <inline-formula> <tex-math notation="LaTeX">O(n/\log \log n) </tex-math></inline-formula>) that can be efficiently reconstructed from <inline-formula> <tex-math notation="LaTeX">\exp (O(\log ^{2/3}n)) </tex-math></inline-formula> (resp. <inline-formula> <tex-math notation="LaTeX">\exp (O(\log \log n)^{2/3}) </tex-math></inline-formula>) traces, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the message length. Then, we give a construction of a code with <inline-formula> <tex-math notation="LaTeX">O(\log n) </tex-math></inline-formula> bits of redundancy that can be efficiently reconstructed from <inline-formula> <tex-math notation="LaTeX">\text {poly}(n) </tex-math></inline-formula> traces if the deletion probability is small enough. Finally, we show how to combine both approaches, giving rise to an efficient code with <inline-formula> <tex-math notation="LaTeX">O(n/\log n) </tex-math></inline-formula> bits of redundancy which can be reconstructed from <inline-formula> <tex-math notation="LaTeX">\text {poly}(\log n) </tex-math></inline-formula> traces for a small constant deletion probability. |
|---|---|
| AbstractList | Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of coded trace reconstruction , the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called traces ) corrupted by edit errors. Codes used in current portable DNA-based storage systems with nanopore sequencers are largely based on heuristics, and have no provable robustness or performance guarantees even for an error model with i.i.d. deletions and constant deletion probability. Our work is the first step towards the design of efficient codes with provable guarantees for such systems. We consider a constant rate of i.i.d. deletions, and perform an analysis of marker-based code-constructions. This gives rise to codes with redundancy <inline-formula> <tex-math notation="LaTeX">O(n/\log n) </tex-math></inline-formula> (resp. <inline-formula> <tex-math notation="LaTeX">O(n/\log \log n) </tex-math></inline-formula>) that can be efficiently reconstructed from <inline-formula> <tex-math notation="LaTeX">\exp (O(\log ^{2/3}n)) </tex-math></inline-formula> (resp. <inline-formula> <tex-math notation="LaTeX">\exp (O(\log \log n)^{2/3}) </tex-math></inline-formula>) traces, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the message length. Then, we give a construction of a code with <inline-formula> <tex-math notation="LaTeX">O(\log n) </tex-math></inline-formula> bits of redundancy that can be efficiently reconstructed from <inline-formula> <tex-math notation="LaTeX">\text {poly}(n) </tex-math></inline-formula> traces if the deletion probability is small enough. Finally, we show how to combine both approaches, giving rise to an efficient code with <inline-formula> <tex-math notation="LaTeX">O(n/\log n) </tex-math></inline-formula> bits of redundancy which can be reconstructed from <inline-formula> <tex-math notation="LaTeX">\text {poly}(\log n) </tex-math></inline-formula> traces for a small constant deletion probability. Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of coded trace reconstruction , the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called traces ) corrupted by edit errors. Codes used in current portable DNA-based storage systems with nanopore sequencers are largely based on heuristics, and have no provable robustness or performance guarantees even for an error model with i.i.d. deletions and constant deletion probability. Our work is the first step towards the design of efficient codes with provable guarantees for such systems. We consider a constant rate of i.i.d. deletions, and perform an analysis of marker-based code-constructions. This gives rise to codes with redundancy [Formula Omitted] (resp. [Formula Omitted]) that can be efficiently reconstructed from [Formula Omitted] (resp. [Formula Omitted]) traces, where [Formula Omitted] is the message length. Then, we give a construction of a code with [Formula Omitted] bits of redundancy that can be efficiently reconstructed from [Formula Omitted] traces if the deletion probability is small enough. Finally, we show how to combine both approaches, giving rise to an efficient code with [Formula Omitted] bits of redundancy which can be reconstructed from [Formula Omitted] traces for a small constant deletion probability. |
| Author | Gabrys, Ryan Ribeiro, Joao Cheraghchi, Mahdi Milenkovic, Olgica |
| Author_xml | – sequence: 1 givenname: Mahdi orcidid: 0000-0001-8957-0306 surname: Cheraghchi fullname: Cheraghchi, Mahdi email: mahdich@umich.edu organization: Department of Computing, Imperial College London, London, U.K – sequence: 2 givenname: Ryan orcidid: 0000-0002-9197-3371 surname: Gabrys fullname: Gabrys, Ryan email: ryan.gabrys@gmail.com organization: ECE Department, University of Illinois at Urbana-Champaign, Urbana, IL, USA – sequence: 3 givenname: Olgica surname: Milenkovic fullname: Milenkovic, Olgica email: milenkov@illinois.edu organization: ECE Department, University of Illinois at Urbana-Champaign, Urbana, IL, USA – sequence: 4 givenname: Joao orcidid: 0000-0002-9870-0501 surname: Ribeiro fullname: Ribeiro, Joao email: j.lourenco-ribeiro17@imperial.ac.uk organization: Department of Computing, Imperial College London, London, U.K |
| BookMark | eNp9kE1Lw0AQhhepYFq9i14KnlNnP5LdOUqxWigIEs_LZj8gpWbrbnrw35vS4sGDp2Hgfd4ZnimZ9LH3hNxSWFAK-NismwUDBguGWHMpL0hBq0qWWFdiQgoAqkoUQl2Rac7bcRUVZQW5W0bn3bxJxvr5u7exz0M62KGL_TW5DGaX_c15zsjH6rlZvpabt5f18mlTWoZ0KFWrJOc2CFpTxahplcGAFg1zQVhLvREsMKWAC-Okb4ORzlUBDLMgwdV8Rh5OvfsUvw4-D3obD6kfT2omRA2VQoVjqj6lbIo5Jx-07QZz_HNIpttpCvroQY8e9NGDPnsYQfgD7lP3adL3f8j9Cem8979xBJTIGf8Be_Jo6A |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TIT_2024_3493762 crossref_primary_10_1109_TCOMM_2022_3222341 crossref_primary_10_1016_j_tcs_2025_115279 crossref_primary_10_1109_TIT_2022_3157383 crossref_primary_10_1109_TIT_2020_3033513 crossref_primary_10_1109_TIT_2023_3267620 crossref_primary_10_1109_TIT_2023_3269124 crossref_primary_10_1109_TIT_2023_3269289 crossref_primary_10_1214_21_AAP1662 crossref_primary_10_1109_TIT_2020_3030569 crossref_primary_10_1016_j_disc_2022_113115 crossref_primary_10_1109_TIT_2023_3260872 crossref_primary_10_3390_e27010039 crossref_primary_10_1109_TIT_2022_3168624 crossref_primary_10_1109_TIT_2021_3066010 crossref_primary_10_1109_TIT_2025_3541375 crossref_primary_10_1109_TMBMC_2024_3403488 crossref_primary_10_1017_jpr_2022_81 crossref_primary_10_1109_TIT_2022_3206527 crossref_primary_10_1109_TIT_2023_3318354 crossref_primary_10_1109_TIT_2022_3231752 crossref_primary_10_1109_TIT_2025_3568068 crossref_primary_10_1038_s41467_022_33046_w crossref_primary_10_1109_TCOMM_2024_3367748 crossref_primary_10_1109_TIT_2023_3250459 crossref_primary_10_1109_TIT_2024_3518760 crossref_primary_10_1109_TIT_2021_3049627 crossref_primary_10_1038_s41467_022_30140_x crossref_primary_10_1109_TCOMM_2023_3330848 crossref_primary_10_1109_TIT_2022_3184868 |
| Cites_doi | 10.1109/18.904499 10.1109/FOCS.2019.00029 10.1109/TIT.2017.2789292 10.1002/rsa.3240030308 10.1109/TMBMC.2016.2630056 10.1109/ISIT.2019.8849687 10.1002/anie.201411378 10.1109/ISIT.2019.8849647 10.1109/TIT.2018.2800044 10.1109/ISIT.2019.8849737 10.1038/s41598-017-05188-1 10.1109/FOCS.2019.00050 10.1038/nature11875 10.1145/3055399.3055450 10.1109/TIT.1986.1057136 10.1145/3055399.3055494 10.1109/ISIT.2019.8849740 10.1109/ISIT.2019.8849567 10.1109/ISIT.2017.8007106 10.1109/TMBMC.2016.2537305 10.1109/ITW.2014.6970811 10.1109/ISIT.2019.8849523 10.1007/978-3-662-44777-2_57 10.1109/FOCS.2017.29 10.1109/FOCS.2018.00028 10.1109/TIT.2018.2859813 10.1109/JSAC.2010.100207 10.1109/ISIT.2019.8849596 10.1109/ISIT.2018.8437544 10.1109/MSPEC.2018.8352574 10.1109/ISIT.2018.8437909 10.1109/TIT.2016.2555321 10.1109/ISIT.2018.8437519 10.1038/srep14138 10.1038/nbt.4079 10.1137/1.9781611975062.6 10.1109/ISIT.2019.8849789 10.1109/ISIT.2017.8006740 10.1109/TIT.2017.2649493 10.1109/TIT.2018.2792488 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.2020.2996377 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 6103 |
| ExternalDocumentID | 10_1109_TIT_2020_2996377 9097932 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: NSF and Semiconductor Research Corporation (SRC) SemiSynBio Award funderid: 10.13039/100000028 – fundername: NSF grantid: 1618366 funderid: 10.13039/100000001 – fundername: Defense Advanced Research Projects Agency (DARPA) Molecular Informatics Program funderid: 10.13039/100000185 – fundername: Center for Science of Information (CSoI) – fundername: NSF Science and Technology Center grantid: CCF-0939370 funderid: 10.13039/100000001 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c291t-8b8733cf4161821ab8a9f9c9a2df4cc1ea42f288034ad7ebfa7dd5f0a2c070d63 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000540384500074&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Sun Oct 05 00:18:08 EDT 2025 Sat Nov 29 03:31:43 EST 2025 Tue Nov 18 22:18:25 EST 2025 Wed Aug 27 02:31:56 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-8b8733cf4161821ab8a9f9c9a2df4cc1ea42f288034ad7ebfa7dd5f0a2c070d63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-8957-0306 0000-0002-9870-0501 0000-0002-9197-3371 |
| PQID | 2446058989 |
| PQPubID | 36024 |
| PageCount | 20 |
| ParticipantIDs | proquest_journals_2446058989 crossref_primary_10_1109_TIT_2020_2996377 crossref_citationtrail_10_1109_TIT_2020_2996377 ieee_primary_9097932 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-10-01 |
| PublicationDateYYYYMMDD | 2020-10-01 |
| PublicationDate_xml | – month: 10 year: 2020 text: 2020-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2020 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref14 ref11 ref10 ref16 ref19 ref50 ref46 ref45 ref48 ref47 ref42 davies (ref38) 2019 krishnamurthy (ref41) 2019 ref43 ref49 ref7 ref9 ref4 ref3 brakensiek (ref44) 2019 ref6 ref5 holden (ref18) 2018 yazdi (ref34) 2015; 5 ref35 rashtchian (ref15) 2017 ref37 ref36 ref31 ref30 batu (ref1) 2004 ref33 ref32 holenstein (ref2) 2008 ref39 guruswami (ref51) 2018 chase (ref17) 2019 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ban (ref40) 2019 ref29 holden (ref8) 2018 |
| References_xml | – ident: ref9 doi: 10.1109/18.904499 – ident: ref46 doi: 10.1109/FOCS.2019.00029 – ident: ref29 doi: 10.1109/TIT.2017.2789292 – ident: ref45 doi: 10.1002/rsa.3240030308 – ident: ref19 doi: 10.1109/TMBMC.2016.2630056 – ident: ref26 doi: 10.1109/ISIT.2019.8849687 – start-page: 389 year: 2008 ident: ref2 article-title: Trace reconstruction with constant deletion probability and related results publication-title: Proc 19th Annu ACM-SIAM Symp Discrete Algorithms (SODA) – ident: ref33 doi: 10.1002/anie.201411378 – start-page: 44:1 year: 2019 ident: ref40 article-title: Efficient average-case population recovery in the presence of insertions and deletions publication-title: Proceedings of APPROX/RANDOM – ident: ref43 doi: 10.1109/ISIT.2019.8849647 – ident: ref11 doi: 10.1109/TIT.2018.2800044 – ident: ref16 doi: 10.1109/ISIT.2019.8849737 – ident: ref13 doi: 10.1038/s41598-017-05188-1 – ident: ref39 doi: 10.1109/FOCS.2019.00050 – ident: ref32 doi: 10.1038/nature11875 – ident: ref4 doi: 10.1145/3055399.3055450 – ident: ref49 doi: 10.1109/TIT.1986.1057136 – ident: ref5 doi: 10.1145/3055399.3055494 – ident: ref42 doi: 10.1109/ISIT.2019.8849740 – ident: ref37 doi: 10.1109/ISIT.2019.8849567 – ident: ref30 doi: 10.1109/ISIT.2017.8007106 – ident: ref35 doi: 10.1109/TMBMC.2016.2537305 – ident: ref23 doi: 10.1109/ITW.2014.6970811 – ident: ref28 doi: 10.1109/ISIT.2019.8849523 – start-page: 910 year: 2004 ident: ref1 article-title: Reconstructing strings from random traces publication-title: Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA) – ident: ref3 doi: 10.1007/978-3-662-44777-2_57 – ident: ref7 doi: 10.1109/FOCS.2017.29 – ident: ref47 doi: 10.1109/FOCS.2018.00028 – ident: ref12 doi: 10.1109/TIT.2018.2859813 – start-page: 3360 year: 2017 ident: ref15 article-title: Clustering billions of reads for DNA data storage publication-title: Proc Conf Neural Inf Process Syst (NIPS) – year: 2019 ident: ref44 article-title: Coded trace reconstruction in a constant number of traces publication-title: arXiv 1908 03996 – ident: ref50 doi: 10.1109/JSAC.2010.100207 – start-page: 961 year: 2019 ident: ref38 article-title: Reconstructing trees from traces publication-title: Proc Conf Learning Theory (COLT) – ident: ref27 doi: 10.1109/ISIT.2019.8849596 – ident: ref25 doi: 10.1109/ISIT.2018.8437544 – year: 2018 ident: ref51 publication-title: Coding Theory the Essentials – ident: ref36 doi: 10.1109/MSPEC.2018.8352574 – ident: ref22 doi: 10.1109/ISIT.2018.8437909 – ident: ref20 doi: 10.1109/TIT.2016.2555321 – ident: ref24 doi: 10.1109/ISIT.2018.8437519 – year: 2018 ident: ref18 article-title: Lower bounds for trace reconstruction publication-title: arXiv 1808 02336 – volume: 5 start-page: 14138 year: 2015 ident: ref34 article-title: A rewritable, random-access DNA-based storage system publication-title: Sci Rep doi: 10.1038/srep14138 – ident: ref14 doi: 10.1038/nbt.4079 – ident: ref6 doi: 10.1137/1.9781611975062.6 – start-page: 1799 year: 2018 ident: ref8 article-title: Subpolynomial trace reconstruction for random strings and arbitrary deletion probability publication-title: Proc Conf Learning Theory (COLT) – ident: ref31 doi: 10.1109/ISIT.2019.8849789 – ident: ref21 doi: 10.1109/ISIT.2017.8006740 – ident: ref10 doi: 10.1109/TIT.2017.2649493 – year: 2019 ident: ref17 article-title: New lower bounds for trace reconstruction publication-title: arXiv 1905 03031 – ident: ref48 doi: 10.1109/TIT.2018.2792488 – start-page: 68:1 year: 2019 ident: ref41 article-title: Trace reconstruction: Generalized and parameterized publication-title: Proc Ann European Symp Algorithms (ESA) |
| SSID | ssj0014512 |
| Score | 2.6161075 |
| Snippet | Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of coded trace reconstruction , the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 6084 |
| SubjectTerms | Coding Data storage systems Deletion deletion channel DNA DNA storage Encoding Porosity Reconstruction Reconstruction algorithms Redundancy Robustness Sequential analysis Storage systems trace reconstruction |
| Title | Coded Trace Reconstruction |
| URI | https://ieeexplore.ieee.org/document/9097932 https://www.proquest.com/docview/2446058989 |
| Volume | 66 |
| WOSCitedRecordID | wos000540384500074&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8aAHq61ia5U9eBHcdjfJbjZHKRYFKR6q9LbkCYK0Yqu_38m-VBTB2x6SEL7km8dOZgbgnBCdKGRSiNyhIdOEhSqSIkyl5U5JNGGLRNrHOz6bZYuFuG_BZZMLY60tHp_Zkf8sYvlmpd_8r7KxiAReJxS4W5zzMleriRiwJC4rg8dIYPQ56pBkJMbz2zk6giQaoehNKeffVFDRU-WHIC60y7Tzv33tw15lRQZX5bEfQMsuu9CpOzQEFWG7sPul3GAPBpOVsSZA9aRt4P3Oz-qxh_AwvZ5PbsKqN0KoiYg3YaYyTql23j_JSCxVJoUTWkhiHNM6tpIRR5CclEnDrXKSG5O4SBKNJDcpPYL2crW0xxBQahOiiIxSrRiTuI5mzhHrUsuR7WkfxjVcua4Kh_v-Fc954UBEIkeAcw9wXgHch4tmxktZNOOPsT0PaDOuwrIPw_pE8opV6xxNER_FFZkY_D7rBHb82uVjuyG0EUR7Ctv6ffO0fj0rLswH0Aq8hg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH8MFdSD001xc2oPXgS7tWnaNEcZjg3n8FBlt5KkCQiyiZv-_b70S0URvPWQpOWX_N5HX957ABeEqFAik1zkTuBSRagrPcHdSGhmpEATNk-kfZyy2Syez_l9A67qXBitdX75TPftYx7Lz5bqzf4qG3CP43FCgbsZUkr8IlurjhnQ0C9qg_tIYfQ6qqCkxwfJJEFXkHh9FL5RwNg3JZR3VfkhinP9Mmr-78v2Ya-0I53rYuMPoKEXLWhWPRqckrIt2P1ScLAN3eEy05mDCkppx3qen_VjD-FhdJMMx27ZHcFVhPtrN5YxCwJlrIcSE1_IWHDDFRckM1QpXwtKDEF6BlRkTEsjWJaFxhNEIc2zKDiCjcVyoY_BCQIdEkmEFylJqcB1FDWGaBNphnyPOjCo4EpVWTrcdrB4TnMXwuMpApxagNMS4A5c1jNeirIZf4xtW0DrcSWWHehVO5KWvFqlaIzYOC6Peff3WeewPU7upul0Mrs9gR37nuLqXQ82EFB9Clvqff20ej3LD88HzZm_zQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Coded+Trace+Reconstruction&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Cheraghchi%2C+Mahdi&rft.au=Gabrys%2C+Ryan&rft.au=Milenkovic%2C+Olgica&rft.au=Ribeiro%2C+Joao&rft.date=2020-10-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=66&rft.issue=10&rft.spage=6084&rft.epage=6103&rft_id=info:doi/10.1109%2FTIT.2020.2996377&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2020_2996377 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |