We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
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...
—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...
Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Baom...
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...
(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...