New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes

New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes

We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields increasingly tighter upper bounds on the rate as its cont...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Loyfer, Elyassaf, Linial, Nati
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Loyfer, Elyassaf
Linial, Nati
description We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields increasingly tighter upper bounds on the rate as its control parameter increases. Numerical experiments show significant improvement compared to Delsarte. These convincing numerical results, and the large variety of tools available for asymptotic analysis, give us hope that our work will lead to new and improved asymptotic upper bounds on the possible rate of linear codes. A concurrent work by Coregliano, Jeronimo, and Jones offers a closely related family of linear programs which converges to the true bound. Here we provide a new proof of convergence for the same LPs.
doi_str_mv 10.48550/arxiv.2206.09211
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2206_09211</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2206_09211</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-f2f02b30ad7806d7455c573d6c1c067f9401ea2efbe2b6fb366ff5dce11d1cb53</originalsourceid><addsrcrecordid>eNotz71OwzAUQGEvDKjwAEzcF3CwndhuRwi_agQVKnN0bV8LS20S2aHA2yMK09mO9DF2IUXVLLUWV5i_0qFSSphKrJSUp2z9TJ_QbbjDQgHepoky3IwfQyiQBpjfCV5xJn4oFb9NZcbBE2zy6Ha0hzhm6NJAmKEdA5UzdhJxV-j8vwu2vb_bto-8e3l4aq87jsZKHlUUytUCg10KE2yjtde2DsZLL4yNq0ZIQkXRkXImutqYGHXwJGWQ3ul6wS7_tkdNP-W0x_zd_6r6o6r-AYVaRro</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes</title><source>arXiv.org</source><creator>Loyfer, Elyassaf ; Linial, Nati</creator><creatorcontrib>Loyfer, Elyassaf ; Linial, Nati</creatorcontrib><description>We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields increasingly tighter upper bounds on the rate as its control parameter increases. Numerical experiments show significant improvement compared to Delsarte. These convincing numerical results, and the large variety of tools available for asymptotic analysis, give us hope that our work will lead to new and improved asymptotic upper bounds on the possible rate of linear codes. A concurrent work by Coregliano, Jeronimo, and Jones offers a closely related family of linear programs which converges to the true bound. Here we provide a new proof of convergence for the same LPs.</description><identifier>DOI: 10.48550/arxiv.2206.09211</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2022-06</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2206.09211$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2206.09211$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Loyfer, Elyassaf</creatorcontrib><creatorcontrib>Linial, Nati</creatorcontrib><title>New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes</title><description>We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields increasingly tighter upper bounds on the rate as its control parameter increases. Numerical experiments show significant improvement compared to Delsarte. These convincing numerical results, and the large variety of tools available for asymptotic analysis, give us hope that our work will lead to new and improved asymptotic upper bounds on the possible rate of linear codes. A concurrent work by Coregliano, Jeronimo, and Jones offers a closely related family of linear programs which converges to the true bound. Here we provide a new proof of convergence for the same LPs.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUQGEvDKjwAEzcF3CwndhuRwi_agQVKnN0bV8LS20S2aHA2yMK09mO9DF2IUXVLLUWV5i_0qFSSphKrJSUp2z9TJ_QbbjDQgHepoky3IwfQyiQBpjfCV5xJn4oFb9NZcbBE2zy6Ha0hzhm6NJAmKEdA5UzdhJxV-j8vwu2vb_bto-8e3l4aq87jsZKHlUUytUCg10KE2yjtde2DsZLL4yNq0ZIQkXRkXImutqYGHXwJGWQ3ul6wS7_tkdNP-W0x_zd_6r6o6r-AYVaRro</recordid><startdate>20220618</startdate><enddate>20220618</enddate><creator>Loyfer, Elyassaf</creator><creator>Linial, Nati</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220618</creationdate><title>New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes</title><author>Loyfer, Elyassaf ; Linial, Nati</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-f2f02b30ad7806d7455c573d6c1c067f9401ea2efbe2b6fb366ff5dce11d1cb53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Loyfer, Elyassaf</creatorcontrib><creatorcontrib>Linial, Nati</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Loyfer, Elyassaf</au><au>Linial, Nati</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes</atitle><date>2022-06-18</date><risdate>2022</risdate><abstract>We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields increasingly tighter upper bounds on the rate as its control parameter increases. Numerical experiments show significant improvement compared to Delsarte. These convincing numerical results, and the large variety of tools available for asymptotic analysis, give us hope that our work will lead to new and improved asymptotic upper bounds on the possible rate of linear codes. A concurrent work by Coregliano, Jeronimo, and Jones offers a closely related family of linear programs which converges to the true bound. Here we provide a new proof of convergence for the same LPs.</abstract><doi>10.48550/arxiv.2206.09211</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2206.09211
ispartof
issn
language eng
recordid cdi_arxiv_primary_2206_09211
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T20%3A34%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=New%20LP-based%20Upper%20Bounds%20in%20the%20Rate-vs.-Distance%20Problem%20for%20Linear%20Codes&rft.au=Loyfer,%20Elyassaf&rft.date=2022-06-18&rft_id=info:doi/10.48550/arxiv.2206.09211&rft_dat=%3Carxiv_GOX%3E2206_09211%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true