Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes
We construct binary linear codes that are efficiently list- decodable up to a fraction (1/2 - epsiv) of errors. The codes encode k bits into n = poly(k/epsiv) bits and are constructible and list-decodable in time polynomial in k and 1/epsiv (in particular, in our results epsiv need not be constant a...
Saved in:
Published in | 2008 23rd Annual IEEE Conference on Computational Complexity pp. 163 - 174 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2008
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We construct binary linear codes that are efficiently list- decodable up to a fraction (1/2 - epsiv) of errors. The codes encode k bits into n = poly(k/epsiv) bits and are constructible and list-decodable in time polynomial in k and 1/epsiv (in particular, in our results epsiv need not be constant and can even be polynomially small in n). Our results give the best known polynomial dependence of n on k and 1/epsiv for such codes. Specifically, we are able to achieve n les O(k 3 /epsiv 3+gamma ) or, if a linear dependence on k is required, n les O (k/epsiv 5+gamma ), where gamma > 0 is an arbitrary constant. The best previously known constructive bounds in this setting were n les O(k 2 /epsiv 4 ) and n les O(k/ epsiv 6 ). Non-constructively, a random linear encoding of length n = O(k/epsiv 2 ) suffices, but no sub-exponential algorithm is known for list decoding random codes. Our construction with a cubic dependence on epsiv is obtained by concatenating the recent Parvaresh-Vardy (PV) codes with dual BCH codes, and crucially exploits the soft decoding algorithm for PV codes. This result yields better hardness results for the problem of approximating NP witnesses in the model of Kumar and Sivakumar. Our result with the linear dependence on k is based on concatenation of the PV code with an arbitrary inner code of good minimum distance. In addition to being a basic question in coding theory, codes that are list-decodable from a fraction (1/2 - epsiv) of errors for epsiv rarr 0 have found many uses in complexity theory. In addition, our codes have the property that all nonzero codewords have relative Hamming weights in the range (1/2 - epsiv, 1/2 + epsiv); this epsiv-biased property is a fundamental notion in pseudorandomness. |
---|---|
AbstractList | We construct binary linear codes that are efficiently list- decodable up to a fraction (1/2 - epsiv) of errors. The codes encode k bits into n = poly(k/epsiv) bits and are constructible and list-decodable in time polynomial in k and 1/epsiv (in particular, in our results epsiv need not be constant and can even be polynomially small in n). Our results give the best known polynomial dependence of n on k and 1/epsiv for such codes. Specifically, we are able to achieve n les O(k 3 /epsiv 3+gamma ) or, if a linear dependence on k is required, n les O (k/epsiv 5+gamma ), where gamma > 0 is an arbitrary constant. The best previously known constructive bounds in this setting were n les O(k 2 /epsiv 4 ) and n les O(k/ epsiv 6 ). Non-constructively, a random linear encoding of length n = O(k/epsiv 2 ) suffices, but no sub-exponential algorithm is known for list decoding random codes. Our construction with a cubic dependence on epsiv is obtained by concatenating the recent Parvaresh-Vardy (PV) codes with dual BCH codes, and crucially exploits the soft decoding algorithm for PV codes. This result yields better hardness results for the problem of approximating NP witnesses in the model of Kumar and Sivakumar. Our result with the linear dependence on k is based on concatenation of the PV code with an arbitrary inner code of good minimum distance. In addition to being a basic question in coding theory, codes that are list-decodable from a fraction (1/2 - epsiv) of errors for epsiv rarr 0 have found many uses in complexity theory. In addition, our codes have the property that all nonzero codewords have relative Hamming weights in the range (1/2 - epsiv, 1/2 + epsiv); this epsiv-biased property is a fundamental notion in pseudorandomness. |
Author | Guruswami, V. Rudra, A. |
Author_xml | – sequence: 1 givenname: V. surname: Guruswami fullname: Guruswami, V. organization: Dept. of Comput. Sci. & Eng., Univ. of Washington, Seattle, WA – sequence: 2 givenname: A. surname: Rudra fullname: Rudra, A. |
BookMark | eNp9yr1OwzAUQOErKBJpydSRxQ9Qh-s4Tuw17k-GbmWPXHKLjNIYxWHo2xfRzkxnON8cZkMYCGApMBMCzZu1NssRdSbkAyS5qhTXBcpHSE2lsSqNkqI0xQySXy05CmWeIY3xCxGFKStUJoHdIZwmtqaP0Pnhc8XWP65ntW2YDR3FFXNDx2qaJhrZ3seJ_0l37IkRr72L1N3kCzydXB8pvXcBr9vNu224J6L2e_RnN17aQimtc5T_3yuByD2e |
ContentType | Conference Proceeding |
DBID | 6IE 6IH CBEJK RIE RIO |
DOI | 10.1109/CCC.2008.13 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP) 1998-present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEL url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science Mathematics |
EISSN | 2575-8403 |
EndPage | 174 |
ExternalDocumentID | 4558820 |
Genre | orig-research |
GroupedDBID | -~X 23M 29F 29O 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO RNS |
ID | FETCH-ieee_primary_45588203 |
IEDL.DBID | RIE |
ISBN | 9780769531694 0769531695 |
ISSN | 1093-0159 |
IngestDate | Wed Jun 26 19:24:18 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | true |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-ieee_primary_45588203 |
ParticipantIDs | ieee_primary_4558820 |
PublicationCentury | 2000 |
PublicationDate | 2008-June |
PublicationDateYYYYMMDD | 2008-06-01 |
PublicationDate_xml | – month: 06 year: 2008 text: 2008-June |
PublicationDecade | 2000 |
PublicationTitle | 2008 23rd Annual IEEE Conference on Computational Complexity |
PublicationTitleAbbrev | CCC |
PublicationYear | 2008 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
SSID | ssj0001967059 ssj0019955 |
Score | 3.408048 |
Snippet | We construct binary linear codes that are efficiently list- decodable up to a fraction (1/2 - epsiv) of errors. The codes encode k bits into n = poly(k/epsiv)... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 163 |
SubjectTerms | Complexity theory Computational complexity Computer errors Computer science Decoding Hamming weight Linear code Mathematics Polynomials Virtual colonoscopy |
Title | Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes |
URI | https://ieeexplore.ieee.org/document/4558820 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8JAEJ0gJ72ggFFRswePLB_d3dK9UkRixJioCTdSutPEaIoRevHXO7tbwBgOXpq2mTbTdNvZNzvvDcANoaos6kvFQyEEl4mSXIcR8n4WBVmYGAxcF4XpYzh5lfczNatAe8uFQURXfIYdu-vW8s0yLWyqrCuVogkhAfSDqBd4rtYun6LDgZsqlCsIWruOp1YtieCy0h6yaxpytCmVdzbHsiTukXE3jmNfYWkbHvxquOLizbgG042nvszkvVOsF530-4-I438f5RiaO2Yfe9rGrBOoYF6H2qa1Ayu_9DocTbdyrqsG3D3Tz5qNCKnaq9psVCQfbBhPWLw0uGqzJDds6HhB7IGGDXeWlpPFkA_fKE4ab9mE1vj2JZ5w6-n80wtdzEsnxSlU82WOZ8A0Dox0ijEilcpkC0KPuhclIlU9FIE-h8a-O1zsP92CQ19-YZMal1BdfxV4RTF-vbh2L_cHob6gDw |
link.rule.ids | 310,311,786,790,795,796,802,27958,55109 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8JAEJ0QPKgXFDAqfuzBI8vX7pbulaJWpcRETLiR0t0mRlOM0Iu_3tndAsZw8NK0zbSZptvOvtl5bwBuEFWlfpcL6jHGKI8Fp9LzNe2mfi_1YqV7totCNPbCV_44FdMSNDdcGK21LT7TLbNr1_LVIslNqqzNhcAJIQL0PYzzHenYWtuMivT6drJQrCFIaXueGr0kBMxCOtAucdDhptDeWR_zgrqHxu0gCFyNpWl58Kvlio04dxWI1r66QpP3Vr6at5LvPzKO_32YI6hvuX3keRO1jqGksypU1s0dSPGtV-Ew2gi6Lmtw_4K_azJErGquapJhHn-QQRCSYKH0skniTJGBZQaREQ4cai0NK4toOnjDSKmcZR0ad7eTIKTG09mnk7qYFU6yEyhni0yfApG6r7jVjGEJFyqdI36UHT9mieho1pNnUNt1h_Pdp69hP5xEo9noYfzUgANXjGFSHBdQXn3l-hIj_mp-ZV_0D00Qo2U |
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%3Abook&rft.genre=proceeding&rft.title=2008+23rd+Annual+IEEE+Conference+on+Computational+Complexity&rft.atitle=Soft+Decoding%2C+Dual+BCH+Codes%2C+and+Better+List-Decodable+e-Biased+Codes&rft.au=Guruswami%2C+V.&rft.au=Rudra%2C+A.&rft.date=2008-06-01&rft.pub=IEEE&rft.isbn=9780769531694&rft.issn=1093-0159&rft.eissn=2575-8403&rft.spage=163&rft.epage=174&rft_id=info:doi/10.1109%2FCCC.2008.13&rft.externalDocID=4558820 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1093-0159&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1093-0159&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1093-0159&client=summon |