Back to Results
First PageMeta Content
Combinatorics / Finite fields / Information theory / Error detection and correction / Linear code / Association scheme / Constant-weight code / Big O notation / Distributed source coding / Mathematics / Coding theory / Discrete mathematics


Numerical results on the asymptotic rate of binary codes A. Barg and David B. Jaffe A BSTRACT. We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each va
Add to Reading List

Document Date: 2000-03-22 13:00:52

Open Document

File Size: 424,89 KB

Share Result on Facebook

City

Amsterdam / Vilnius / INCOLN / Moscow / /

Company

Philips / Hamming LP / /

IndustryTerm

online database / /

Organization

National Science Foundation / /

Person

David B. Jaffe / Ai / /

Position

General / second author / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

C / /

ProvinceOrState

New Jersey / /

PublishedMedium

Lecture Notes in Computer Science / IEEE Transactions on Information Theory / /

Technology

Alpha / 21264 processor / html / /

URL

http /

SocialTag