AbstractIn this paper we establish a connection between polarized partition relations and the functionAq (n, d) of coding theory, which implies some known results and new examples of polarized relations. A connection between Aq(n, d) and the Zarankiewicz numbers is also discussed
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
Several types of polarized partition relations are considered. In particular we deal with partitions...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
A bound is given on the rate of channel polarization. As a corollary, an earlier bound on the probab...
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arb...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractA test for a code to be divisible, applicable to a spanning set, is developed from a formula...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
Several types of polarized partition relations are considered. In particular we deal with partitions...
This paper surveys parts of the study of divisibility properties of codes. The survey begins with th...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
In recent groundbreaking work, Arikan developed polar codes as an explicit construction of symmetric...
Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's c...
A bound is given on the rate of channel polarization. As a corollary, an earlier bound on the probab...
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arb...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
In 2008, Arikan introduced a powerful family of polar codes, which are the first codes to demonstrab...
DOI
Add to ORKG