Results 271 to 280 of about 103,237 (307)
Some of the next articles are maybe not open access.
Binary Linear Codes With Three Weights
IEEE Communications Letters, 2014In this paper, a class of binary three-weight linear codes is constructed. Their dual codes are also studied. The dual codes are either optimal or almost optimal. These codes have applications in authentication codes, secret sharing schemes, and association schemes, in addition to their applications in consumer electronics and communication and data ...
Cunsheng Ding
exaly +3 more sources
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007
Network coding over a delay-free acyclic communication network with single source is considered in this paper. The network is modeled as a directed acyclic graph G where each edge in G is assumed to have unit link capacity. Previous works on network coding require a sufficiently large field such that the network has either a linear multicast, a linear ...
openaire +1 more source
Network coding over a delay-free acyclic communication network with single source is considered in this paper. The network is modeled as a directed acyclic graph G where each edge in G is assumed to have unit link capacity. Previous works on network coding require a sufficiently large field such that the network has either a linear multicast, a linear ...
openaire +1 more source
On binary linear r-identifying codes
Designs, Codes and Cryptography, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Correctable Errors of Binary Linear Codes
IEEE Transactions on Information Theory, 2010The error correction capability of binary linear codes with minimum distance decoding, in particular the number of correctable/uncorrectable errors, is investigated for general linear codes and the first-order Reed-Muller codes. For linear codes, a lower bound on the number of uncorrectable errors is derived.
Kenji Yasunaga, Toru Fujiwara
openaire +1 more source
The nonexistence of certain binary linear codes
IEEE Transactions on Information Theory, 1990Some of the upper bounds given by T. Verhoeff (1987) are improved by proving the nonexistence of codes with certain parameters. Necessary preliminary results are stated. The results give rise to upper bounds on d(n, k) for many further values of (n, k) by using simple standard techniques.
Raymond Hill, Karen L. Traynor
openaire +1 more source
Detection and recognition of a binary linear code
Discrete Applied Mathematics, 2001 This paper fills the gap in the literature dealing with the specific problem of detecting and recognizing a binary linear code in a binary stream under the hypotheses that the observed binary stream has crossed an encoder and a binary symmetric channel, and we can extract the consecutive (erroneous) code words from it. This leads us to another one, the
exaly +3 more sources
Ars Comb., 2000
By means of a stochastic optimization algorithm, tabu search, nineteen new binary linear codes have been found, which improve bounds on the maximum possible minimum distance. Six among them are optimal, showing that \(d_2 (189,9)=92\), \(d_2 (207,9)=100\), \(d_2 (225,9)=110\), \(d_2 (45,10)=18\), \(d_2 (91,12)=40\), and \(d_2(140,12)=64\), where \(d_2 (
T. Aaron Gulliver +1 more
openaire +1 more source
By means of a stochastic optimization algorithm, tabu search, nineteen new binary linear codes have been found, which improve bounds on the maximum possible minimum distance. Six among them are optimal, showing that \(d_2 (189,9)=92\), \(d_2 (207,9)=100\), \(d_2 (225,9)=110\), \(d_2 (45,10)=18\), \(d_2 (91,12)=40\), and \(d_2(140,12)=64\), where \(d_2 (
T. Aaron Gulliver +1 more
openaire +1 more source
A note on the minimal binary linear code
Cryptography and Communications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng Tang, Xia Li
openaire +1 more source
Homogenization of binary linear codes and their applications
Finite Fields and Their ApplicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jong Yoon Hyun +2 more
openaire +2 more sources
Binary Linear Codes With Few Weights
IEEE Communications Letters, 2016Linear codes can be applied in secret sharing, authentication codes, association schemes, and strongly regular graphs. This letter generalizes the construction of linear codes by Ding et al. [9], uses more flexible construction method, and presents linear codes with few weights.
Yanfeng Qi +2 more
openaire +1 more source