Publication date
August 1990
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula for the polarization of the weight function
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula for the polarization of the weight function
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractIn this paper we establish a connection between polarized partition relations and the functi...
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arb...
AbstractWe present a character-free proof of the divisible code bound and some applications
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
AbstractThe Gleason-Pierce theorem characterizes those fields for which formally self-dual divisible...
A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (...
In this paper, we generalize the theorem given by R. M. Wilson about weights modulo$p^t$in linear co...
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
We study a certain kind of linear codes, namely divisible codes, over finite fields. These codes, in...
AbstractWe prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivide...
AbstractIn this paper we establish a connection between polarized partition relations and the functi...
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arb...
AbstractWe present a character-free proof of the divisible code bound and some applications
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
AbstractThe Gleason-Pierce theorem characterizes those fields for which formally self-dual divisible...
A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (...
In this paper, we generalize the theorem given by R. M. Wilson about weights modulo$p^t$in linear co...
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
International audience—Polar codes form a very powerful family of codes with a low complexity decodi...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
Add to ORKG