56 citations · 229 across the 26 of their papers we have counts for
7 papers · 1 filter
Beyond Countable Alphabets: An Extension of the Information-Spectrum Approach
Shengtian Yang, Thomas Honold, Zhaoyang Zhang
A general approach is established for deriving one-shot performance bounds for information-theoretic problems on general alphabets beyond countable alphabets. It is mainly based on…
An Upper Bound on Broadcast Subspace Codes
Yimin Pang, Thomas Honold
Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framew…
Towards the Capacity Region of Multiplicative Linear Operator Broadcast Channels
Yimin Pang, Thomas Honold
Recent research indicates that packet transmission employing random linear network coding can be regarded as transmitting subspaces over a linear operator channel (LOC). In this pa…
Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields
Shengtian Yang, Thomas Honold, Yan Chen +2
The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approxima…
Good Random Matrices over Finite Fields
Shengtian Yang, Thomas Honold
The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a gene…
Constructing Linear Encoders with Good Spectra
Shengtian Yang, Thomas Honold, Yan Chen +2
Linear encoders with good joint spectra are suitable candidates for optimal lossless joint source-channel coding (JSCC), where the joint spectrum is a variant of the input-output c…
Constructing Linear Codes with Good Joint Spectra
Shengtian Yang, Yan Chen, Thomas Honold +2
The problem of finding good linear codes for joint source-channel coding (JSCC) is investigated in this paper. By the code-spectrum approach, it has been proved in the authors' pre…