Since the breakthrough of Shannon's classical work on information theory there has been exhaustive research on the achievability proofs for the random i.i.d codes. The drawback of such codes is that they admit little or no structure. Practical codes are preferred to be structured, while ensuring reliability. Structured codes, such as linear and lattice codes are such codes of practical interest as they exhibit rich geometric structure. However, the achievable rate achieved by specific structured codes (nested linear and nested lattice codes) in communication channel subjected to erasures has not been studied yet. We address this problem and provide achievability proofs for two common communication channel types, the DMC and AWGN channel wi...
Random independently and identically distributed code ensembles play a fundamental role in character...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, ...
In this paper, we consider coding schemes for computationally bounded channels, which can introduce ...
Since the breakthrough of Shannon's classical work on information theory there has been exhaustive ...
Random nested lattice codes have played an important role in network information theory. However, t...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
Random coding arguments are the backbone of most channel capacity achievability proofs. In this pape...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
Though random codes are shown to be optimal for point-to-point channels, codes with algebraic struct...
Though random codes are shown to be optimal for point-to-point channels, codes with algebraic struct...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually ...
Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the sa...
Random independently and identically distributed code ensembles play a fundamental role in character...
Random independently and identically distributed code ensembles play a fundamental role in character...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, ...
In this paper, we consider coding schemes for computationally bounded channels, which can introduce ...
Since the breakthrough of Shannon's classical work on information theory there has been exhaustive ...
Random nested lattice codes have played an important role in network information theory. However, t...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
Random coding arguments are the backbone of most channel capacity achievability proofs. In this pape...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
Though random codes are shown to be optimal for point-to-point channels, codes with algebraic struct...
Though random codes are shown to be optimal for point-to-point channels, codes with algebraic struct...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually ...
Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the sa...
Random independently and identically distributed code ensembles play a fundamental role in character...
Random independently and identically distributed code ensembles play a fundamental role in character...
A capacity-achieving sequence of degree distributions for the erasure channel is, roughly speaking, ...
In this paper, we consider coding schemes for computationally bounded channels, which can introduce ...
.jpg%3Fwidth%3D300&w=3840&q=75)
Add to ORKG