TIT
2010
13 years 5 months ago
2010
The error correction capability of binary linear codes with minimum distance decoding, in particular the number of correctable/uncorrectable errors, is investigated for general lin...
EUSFLAT
2009
13 years 8 months ago
2009
This paper investigates the potential information provided to the user by the uncertainty measures applied to the possibility distributions associated with the spatial units of an ...
WD
2010
13 years 8 months ago
2010
: In this paper we use an analytical model to study how two radio networks : a primary network and a secondary network can coexist within the same area. We use a very simple protoc...
SIAMDM
2010
13 years 9 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
IJAR
2010
13 years 9 months ago
2010
The present article considers estimating a parameter θ in an imprecise probability model (Pθ)θ∈Θ which consists of coherent upper previsions Pθ . After the definition of a...
COMBINATORICS
2002
13 years 10 months ago
2002
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
SIAMDM
2008
13 years 10 months ago
2008
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
JCT
2006
13 years 11 months ago
2006
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
JSAC
2008
13 years 11 months ago
2008
In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flatfading multiple-input multiple-output (MIMO) channels. The OSM sc...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...