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

First Page		Document Content
Date: 2000-03-22 13:00:52 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 Document is deleted from original location. Use the Download Button below to download from the Web Archive. Download Document from Web Archive File Size: 424,89 KB

Document is deleted from original location. Use the Download Button below to download from the Web Archive.