{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:52:37Z","timestamp":1743004357276,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_14","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random Shortening of\u00a0Linear Codes and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Xue","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songtao","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Omar Alrabiah, Venkatesan Guruswami, and Ray Li. Randomly punctured reed-solomon codes achieve list-decoding capacity over linear-sized fields. arXiv preprint arXiv:2304.09445, 2023","DOI":"10.1145\/3618260.3649634"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Valerio Bioglio, Frederic Gabry, and Ingmar Land. Low-complexity puncturing and shortening of polar codes. In 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), pages 1\u20136. IEEE, 2017","DOI":"10.1109\/WCNCW.2017.7919040"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Joshua Brakensiek, Sivakanth Gopi, and Visu Makam. Generic reed-solomon codes achieve list-decoding capacity. arXiv preprint arXiv:2206.05256, 2022","DOI":"10.1145\/3564246.3585128"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Xue Chen, Kuan Cheng, Xin Li, and Minghui Ouyang. Improved decoding of expander codes. IEEE Transactions on Information Theory, 2023","DOI":"10.1109\/TIT.2023.3239163"},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"3823","DOI":"10.1109\/TIT.2022.3148779","volume":"68","author":"A Ferber","year":"2022","unstructured":"Ferber, A., Kwan, M., Sauermann, L.: List-decodability with large radius for reed-solomon codes. IEEE Trans. Inf. Theory 68(6), 3823\u20133828 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager, R.: Low-density parity-check codes. IRE Transactions on information theory 8(1), 21\u201328 (1962)","journal-title":"IRE Transactions on information theory"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, and Mary Wootters. Improved list-decodability and list-recoverability of reed-solomon codes via tree packings. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 708\u2013719. IEEE, 2022","DOI":"10.1109\/FOCS52979.2021.00074"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Venkatesan Guruswami and Jonathan Mosheiff. Punctured low-bias codes behave like random linear codes. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 36\u201345. IEEE, 2022","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"14_CR9","unstructured":"Eitan Goldberg, Chong Shangguan, and Itzhak Tamo. List-decoding and list-recovery of reed-solomon codes beyond the johnson radius for any rate. arXiv preprint arXiv:2105.14754, 2021"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Zeyu Guo and Zihan Zhang. Randomly punctured reed-solomon codes achieve the list decoding capacity over polynomial-size alphabets. arXiv preprint arXiv:2304.01403, 2023","DOI":"10.1109\/FOCS57990.2023.00019"},{"issue":"8","key":"14_CR11","doi-asserted-by":"publisher","first-page":"5119","DOI":"10.1109\/TIT.2021.3087082","volume":"67","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Ding, C., Tang, C.: Shortened linear codes over finite fields. IEEE Trans. Inf. Theory 67(8), 5119\u20135132 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1109\/TIT.2015.2389248","volume":"61","author":"P Nelson","year":"2015","unstructured":"Nelson, P., van Zwam, S.H.M.: On the existence of asymptotically good linear codes in minor-closed classes. IEEE Trans. Inf. Theory 61(3), 1153\u20131158 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR13","unstructured":"Aaron (Louie) Putterman and Edward Pyne. Pseudorandom linear codes are list decodable to capacity. arXiv preprint arXiv:2303.17554, 2023"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6):34:1\u201334:40, 2009","DOI":"10.1145\/1568318.1568324"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Atri Rudra and Mary Wootters. Every list-decodable code for high noise has abundant near-optimal rate puncturings. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014","DOI":"10.1145\/2591796.2591797"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00037-009-0281-5","volume":"18","author":"A Shpilka","year":"2009","unstructured":"Shpilka, A.: Constructions of low-degree and error-correcting $$\\varepsilon $$-biased generators. Comput. Complex. 18(4), 495\u2013525 (2009)","journal-title":"Comput. Complex."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Michael Sipser and Daniel A Spielman. Expander codes. IEEE transactions on Information Theory, 42(6), 1710\u20131722, 1996","DOI":"10.1109\/18.556667"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Chong Shangguan and Itzhak Tamo. Combinatorial list-decoding of reed-solomon codes beyond the johnson radius. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 538\u2013551, 2020","DOI":"10.1145\/3357713.3384295"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Mary Wootters. On the list decodability of random linear codes with large error rates. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 853\u2013860, 2013","DOI":"10.1145\/2488608.2488716"},{"key":"14_CR20","unstructured":"Arti Yardi and Ruud Pellikaan. On shortened and punctured cyclic codes. arXiv preprint arXiv:1705.09859, 2017"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:27:42Z","timestamp":1730824062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}