List decodability at small radii

DSpace/Manakin Repository


Search DR-NTU

Advanced Search Subject Search


My Account

List decodability at small radii

Show full item record

Title: List decodability at small radii
Author: Chee, Yeow Meng; Ge, Gennian; Ji, Lijun; Ling, San; Yin, Jianxing
Copyright year: 2010
Abstract: A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is determined for all e ≤ 4, except for 42 values of n.
Subject: DRNTU::Science::Mathematics
Type: Journal Article
Series/ Journal Title: Designs, codes and cryptography
School: School of Physical and Mathematical Sciences
Rights: © 2010 Springer Science+Business Media  This is the author created version of a work that has been peer reviewed and accepted for publication by Designs, Codes and Cryptography, Springer.  It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document.  The published version is available at: http://dx.doi.org/10.1007/s10623-010-9445-1 .
Version: Accepted version

Files in this item

Files Size Format View
List decodability at small radii.pdf 151.6Kb PDF View/Open

DOI Query

- Get published version (via Digital Object Identifier)

This item appears in the following Collection(s)

Show full item record


Total views

All Items Views
List decodability at small radii 277

Total downloads

All Bitstreams Views
List decodability at small radii.pdf 132

Top country downloads

Country Code Views
United States of America 48
China 24
Singapore 21
Germany 10
Russian Federation 5

Top city downloads

city Views
Mountain View 38
Singapore 21
Beijing 4
Calcutta 2
Kiez 2

Downloads / month

  2015-02 2015-03 2015-04 total
List decodability at small radii.pdf 0 0 10 10