We propose an information-theoretic bound on the generalization error based a combination of decomposition technique Bu et al. and conditional mutual information (CMI) construction Steinke Zakynthinou. In previous work, Haghifam proposed different combining two aforementioned techniques, which ...

Reed–Solomon codes are a well–studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size q of the underlying field Fq. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.

The transmission over the memoryless additive white Class-A noise (AWCN) channel is considered. For uncoded transmission, an exact expression for the symbol error rate is derived. For coded transmission, the Chernoff bound on the pairwise error probability is calculated and the performance achieved on the real and the complex AWCN channels is compared. Moreover, a lowcomplexity, suboptimum deco...