[引用][C] Some new upper bounds for constant weight codes (Corresp.)
M Colbourn - IEEE Transactions on Information Theory, 1980 - ieeexplore.ieee.org
Some new upper bounds for constant weight codes (Corresp.) Page 1 Some New Upper
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …
Optimal noiseless coding of random variables (Corresp.)
J Dunham - IEEE Transactions on Information Theory, 1980 - ieeexplore.ieee.org
For a discrete n-valued random variable X, Leung-Yan-Cheung and Cover recently showed
that the minimal expected length of one-to-one (not necessarily uniquely decodable) codes …
that the minimal expected length of one-to-one (not necessarily uniquely decodable) codes …
[图书][B] Bounds on the redundancy of noiseless source coding
AC Blumer - 1982 - search.proquest.com
quality of the material submıtted. Page 1 INFORMATION TO USERS This reproductıon was made
from a copy of a document sent to us for microfilming. While the most advanced technology has …
from a copy of a document sent to us for microfilming. While the most advanced technology has …
Some coding theorems based on three types of the exponential form of cost functions
S Kumar, A Choudhary - Open Systems & Information Dynamics, 2012 - World Scientific
Some Coding Theorems Based on Three Types of the Exponential Form of Cost Functions
Page 1 Open Systems & Information Dynamics Vol. 19, No. 4 (2012) 1250026 (14 pages) …
Page 1 Open Systems & Information Dynamics Vol. 19, No. 4 (2012) 1250026 (14 pages) …
Some lower bounds for constant weight codes
I Honkala, H Hämäläinen, M Kaikkonen - Discrete applied mathematics, 1987 - Elsevier
Let A (n, d, w) denote the maximum number of codewords in any binary constant weight
code of length n, minimum distance d and constant weight w. In this note we mention some …
code of length n, minimum distance d and constant weight w. In this note we mention some …
Some bounds for error-correcting codes
L Grey - IRE Transactions on Information Theory, 1962 - ieeexplore.ieee.org
This paper concerns itself with binary coding and more specifically with an upper bound for
the number of binary code works of length n such that every two differ in at least d positions …
the number of binary code works of length n such that every two differ in at least d positions …
An achievable bound for optimal noiseless coding of a random variable (Corresp.)
E Verriest - IEEE transactions on information theory, 1986 - ieeexplore.ieee.org
For a discrete N-valued random variable (N possibly denumerably infinite) Leung-Yan-
Cheong and Cover have given bounds for the minimal expected length of a one-to-one (not …
Cheong and Cover have given bounds for the minimal expected length of a one-to-one (not …
Variable-length coding with cost allowing non-vanishing error probability
H Yagi, R Nomura - IEICE Transactions on Fundamentals of …, 2017 - search.ieice.org
We consider fixed-to-variable length coding with a regular cost function by allowing the error
probability up to any constantε. We first derive finite-length upper and lower bounds on the …
probability up to any constantε. We first derive finite-length upper and lower bounds on the …
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
JH Weber, C de Vroedt… - IEEE transactions on …, 1988 - ieeexplore.ieee.org
Upper bounds to the maximum number of codewords in a binary code of length n and
asymmetric distance Delta are derived for some values of n and Delta. A method is given in …
asymmetric distance Delta are derived for some values of n and Delta. A method is given in …
A new upper bound on codes decodable into size-2 lists
A NEW UPPER BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Page 1 A NEW UPPER
BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Alexei Ashikhmin Los Alamos National …
BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Alexei Ashikhmin Los Alamos National …