Results 301 to 310 of about 7,931,944 (349)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Theory, 2003
Summary: Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each ...
Shuo-Yen Robert Li +2 more
openaire +2 more sources
Summary: Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each ...
Shuo-Yen Robert Li +2 more
openaire +2 more sources
On the maximality of linear codes
Designs, Codes and Cryptography, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. L. Alderson, András Gács
openaire +1 more source
New $[47,15,16]$ Linear Binary Block Code [PDF]
IEEE Transactions on Information Theory, 2008 A new [47,15,16] linear binary block code and its weight spectrum is presented. The code is better than the previously known [47,15,16] code and it reaches the upper bound on code distance for the codeword length 47 and dimension 15.The authors would ...
Peter Farkaš, Ana Garcia Armada
exaly +2 more sources
Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85, 1985
We consider the problem of generating sequential code for programs written in a language which contains a Multiple GOTO operator, predicates and statements. This problem arises when compiling a parallel intermediate form (such as the PDG [3,4]) to run on a sequential machine; in a source-to-source FORTRAN translator when vectorization of a loop has ...
Jeanne Ferrante, Mary E. Mace
openaire +1 more source
We consider the problem of generating sequential code for programs written in a language which contains a Multiple GOTO operator, predicates and statements. This problem arises when compiling a parallel intermediate form (such as the PDG [3,4]) to run on a sequential machine; in a source-to-source FORTRAN translator when vectorization of a loop has ...
Jeanne Ferrante, Mary E. Mace
openaire +1 more source
Problems of Information Transmission, 2017
One of the most famous equalities in coding theory is the McWilliams equality giving a relation between the spectrum \(\{a_0,\ldots,a_n\}\) of a vector space \(V\) and \(\{b_0,\ldots,b_n\}\) of its orthogonal subspace \(V^\ast.\) In this work, V. K. Leont'ev presents a MacWilliams-type equality by analyzing the behavior of the sequence \(\left\{a_s ...
openaire +1 more source
One of the most famous equalities in coding theory is the McWilliams equality giving a relation between the spectrum \(\{a_0,\ldots,a_n\}\) of a vector space \(V\) and \(\{b_0,\ldots,b_n\}\) of its orthogonal subspace \(V^\ast.\) In this work, V. K. Leont'ev presents a MacWilliams-type equality by analyzing the behavior of the sequence \(\left\{a_s ...
openaire +1 more source
Hardness of approximating the minimum distance of a linear code
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999We show that the minimum distance of a linear code (or equivalently, the weight of the lightest codeword) is not approximable to within any constant factor in random polynomial time (RP), unless NP equals RP.
I. Dumer, Daniele Micciancio, M. Sudan
semanticscholar +1 more source
IEEE Transactions on Information Theory, 1998
Summary: Slepian (1960) introduced a structure theory for linear, binary codes and proved that every such code was uniquely the sum of indecomposable codes. He had hoped to produce a canonical form for the generator matrix of an indecomposable code so that he might read off the properties of the code from such a matrix, but such a program proved ...
openaire +1 more source
Summary: Slepian (1960) introduced a structure theory for linear, binary codes and proved that every such code was uniquely the sum of indecomposable codes. He had hoped to produce a canonical form for the generator matrix of an indecomposable code so that he might read off the properties of the code from such a matrix, but such a program proved ...
openaire +1 more source
2018 IEEE International Symposium on Information Theory (ISIT), 2018
In this paper, we construct a new family of codes-linearized Goppa codes embedded with Hamming and rank metric, and determine their parameters. In addition, we give a decoding method with respect to Hamming metric.
openaire +1 more source
In this paper, we construct a new family of codes-linearized Goppa codes embedded with Hamming and rank metric, and determine their parameters. In addition, we give a decoding method with respect to Hamming metric.
openaire +1 more source
A Propagation Rule for Linear Codes
Applicable Algebra in Engineering, Communication and Computing, 2000By a propagation rule it is meant a procedure or a theorem leading to new codes from old ones. The authors introduce a propagation rule for linear codes by considering certain function field extensions. The parameters (length, dimension, distance) of the new code are related to the parameters of the old code and also to three chosen integers.
Harald Niederreiter, Chaoping Xing
openaire +2 more sources
Linear Codes and Character Sums
COMBINATORICA, 2002\textit{G. Kalai} and \textit{N. Linial} [IEEE Trans. Inf. Theory 41, 1467-1472 (1995; Zbl 0831.94019)] conjectured that the size of the code with the distribution of distances near the minimal distance is exponentially small. The authors estimate the fraction of non-zero vectors of minimal weights in an \(r\cdot n\)-dimensional subspace of \(\mathbb{Z}
Nathan Linial, Alex Samorodnitsky
openaire +2 more sources