DCC
1999
IEEE
13 years 11 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
APPROX
2006
Springer
14 years 3 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
ICCCN
2007
IEEE
14 years 5 months ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...
DCC
2004
IEEE
14 years 11 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
DCC
2005
IEEE
14 years 11 months ago
2005
IEEE
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...