activity
20102013
most citedOn Linear Operator Channels over Finite Fields

27 citations · 43 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2013

New Non-asymptotic Random Channel Coding Theorems

En-hui Yang, Jin Meng

New non-asymptotic random coding theorems (with error probability and finite block length ) based on Gallager parity check ensemble and Shannon random code ensemble with a f…

cs.IT2012★ 4 cited

Non-asymptotic Equipartition Properties for Independent and Identically Distributed Sources

En-Hui Yang, Jin Meng

Given an independent and identically distributed source with finite Shannon entropy or differential entropy (as the case may be) , the non-asymp…

cs.IT2012★ 11 cited

Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality

En-Hui Yang, Jin Meng

Recently, a new decoding rule called jar decoding was proposed; under jar decoding, a non-asymptotic achievable tradeoff between the coding rate and word error probability was also…

cs.IT2012

Interactive Encoding and Decoding Based on Binary LDPC Codes with Syndrome Accumulation

Jin Meng, En-Hui Yang

Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alpha…

cs.IT2011★ 1 cited

Capacity Analysis of Linear Operator Channels over Finite Fields

Shenghao Yang, Siu-Wai Ho, Jin Meng +1

Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over fini…

cs.IT2011

Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources

Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi

Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of…

cs.IT2010★ 27 cited

On Linear Operator Channels over Finite Fields

Shenghao Yang, Siu-Wai Ho, Jin Meng +2

Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such…