Sciweavers

215 search results - page 2 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 10 months ago
Coding objects related to Catalan numbers
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr...
Antal Bege, Zoltán Kása
COMBINATORICS
1998
63views more  COMBINATORICS 1998»
13 years 9 months ago
On Kissing Numbers in Dimensions 32 to 128
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
Yves Edel, Eric M. Rains, Neil J. A. Sloane
TIT
2008
102views more  TIT 2008»
13 years 9 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
TIT
2010
144views Education» more  TIT 2010»
13 years 4 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani
TIT
2002
102views more  TIT 2002»
13 years 9 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein