A low-rate improvement on the Elias bound (Corresp.)

An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R < 0.0509^+ , is obtained. The new hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1974-09, Vol.20 (5), p.676-678
Main Authors: Welch, L., McEliece, R., Rumsey, H.
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c334t-e10788e544cc1c38d478c1a8b185de4dd01945a6c1b6108a28fa74601db884663
cites
container_end_page 678
container_issue 5
container_start_page 676
container_title IEEE transactions on information theory
container_volume 20
creator Welch, L.
McEliece, R.
Rumsey, H.
description An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R < 0.0509^+ , is obtained. The new hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .
doi_str_mv 10.1109/TIT.1974.1055279
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28354842</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1055279</ieee_id><sourcerecordid>28354842</sourcerecordid><originalsourceid>FETCH-LOGICAL-c334t-e10788e544cc1c38d478c1a8b185de4dd01945a6c1b6108a28fa74601db884663</originalsourceid><addsrcrecordid>eNpNkEFLw0AQRhdRsFbvgpecRA-JO8lsMjmWUrVQ8FLPy2YzxUiSrbup4r83JT14Gj7mfcPwhLgFmQDI8mm73iZQFpiAVCotyjMxA6WKuMwVnouZlEBxiUiX4iqEzzGignQmcBG17if2ZuCo6fbefXPH_RC5Pho-OFq1jQlR5Q59HT0snfcc9snjtbjYmTbwzWnOxfvzart8jTdvL-vlYhPbLMMhZpAFEStEa8FmVGNBFgxVQKpmrGsJJSqTW6hykGRS2pkCcwl1RYR5ns3F_XR3_OvrwGHQXRMst63p2R2CTilTSJiOoJxA610Innd675vO-F8NUh_16FGPPurRJz1j5W6qNMz8D5-2f2_MXqE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28354842</pqid></control><display><type>article</type><title>A low-rate improvement on the Elias bound (Corresp.)</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Welch, L. ; McEliece, R. ; Rumsey, H.</creator><creatorcontrib>Welch, L. ; McEliece, R. ; Rumsey, H.</creatorcontrib><description>An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R &lt; 0.0509^+ , is obtained. The new hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.1974.1055279</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>IEEE</publisher><ispartof>IEEE transactions on information theory, 1974-09, Vol.20 (5), p.676-678</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c334t-e10788e544cc1c38d478c1a8b185de4dd01945a6c1b6108a28fa74601db884663</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1055279$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Welch, L.</creatorcontrib><creatorcontrib>McEliece, R.</creatorcontrib><creatorcontrib>Rumsey, H.</creatorcontrib><title>A low-rate improvement on the Elias bound (Corresp.)</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R &lt; 0.0509^+ , is obtained. The new hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .</description><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1974</creationdate><recordtype>article</recordtype><recordid>eNpNkEFLw0AQRhdRsFbvgpecRA-JO8lsMjmWUrVQ8FLPy2YzxUiSrbup4r83JT14Gj7mfcPwhLgFmQDI8mm73iZQFpiAVCotyjMxA6WKuMwVnouZlEBxiUiX4iqEzzGignQmcBG17if2ZuCo6fbefXPH_RC5Pho-OFq1jQlR5Q59HT0snfcc9snjtbjYmTbwzWnOxfvzart8jTdvL-vlYhPbLMMhZpAFEStEa8FmVGNBFgxVQKpmrGsJJSqTW6hykGRS2pkCcwl1RYR5ns3F_XR3_OvrwGHQXRMst63p2R2CTilTSJiOoJxA610Innd675vO-F8NUh_16FGPPurRJz1j5W6qNMz8D5-2f2_MXqE</recordid><startdate>19740901</startdate><enddate>19740901</enddate><creator>Welch, L.</creator><creator>McEliece, R.</creator><creator>Rumsey, H.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19740901</creationdate><title>A low-rate improvement on the Elias bound (Corresp.)</title><author>Welch, L. ; McEliece, R. ; Rumsey, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c334t-e10788e544cc1c38d478c1a8b185de4dd01945a6c1b6108a28fa74601db884663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1974</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Welch, L.</creatorcontrib><creatorcontrib>McEliece, R.</creatorcontrib><creatorcontrib>Rumsey, H.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Welch, L.</au><au>McEliece, R.</au><au>Rumsey, H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A low-rate improvement on the Elias bound (Corresp.)</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>1974-09-01</date><risdate>1974</risdate><volume>20</volume><issue>5</issue><spage>676</spage><epage>678</epage><pages>676-678</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>An upper bound on the minimum distance of binary blocks codes, which is superior to Elias' bound for R &lt; 0.0509^+ , is obtained. The new hound has the same derivative (-\infty) at R = 0 as Gilbert's lower bound. (Elias' bound has derivative -\ln 2 at R = 0) .</abstract><pub>IEEE</pub><doi>10.1109/TIT.1974.1055279</doi><tpages>3</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 1974-09, Vol.20 (5), p.676-678
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_miscellaneous_28354842
source IEEE Electronic Library (IEL) Journals
title A low-rate improvement on the Elias bound (Corresp.)
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T00%3A03%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20low-rate%20improvement%20on%20the%20Elias%20bound%20(Corresp.)&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Welch,%20L.&rft.date=1974-09-01&rft.volume=20&rft.issue=5&rft.spage=676&rft.epage=678&rft.pages=676-678&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.1974.1055279&rft_dat=%3Cproquest_cross%3E28354842%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c334t-e10788e544cc1c38d478c1a8b185de4dd01945a6c1b6108a28fa74601db884663%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28354842&rft_id=info:pmid/&rft_ieee_id=1055279&rfr_iscdi=true