Results 1  10
of
1,248
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 574 (9 self)
 Add to MetaCart
In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
sequence { 2k}, where zk E %, the reproduction alphabet. The average distorjion level is (l/n) cl = 1 E[D(X,,z&, where D(x, $ 2 0, x E I, 2 E J, is a preassigned distortion measure. The special assumption made here is that the decoder has access to the side information {Yk}. In this paper we determine
Realcoded genetic algorithms, virtual alphabets, and blocking
, 1990
"... goldbergvmd cso uiuc edu This paper presents a theory of convergence for realcoded genetic algorithmsGAs that use oatingpoint or other highcardinality codings in their chromosomes The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance and r ..."
Abstract

Cited by 107 (7 self)
 Add to MetaCart
goldbergvmd cso uiuc edu This paper presents a theory of convergence for realcoded genetic algorithmsGAs that use oatingpoint or other highcardinality codings in their chromosomes The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance
FAST CODES FOR LARGE ALPHABETS ∗
"... Abstract. We address the problem of constructing a fast lossless code in the case when the source alphabet is large. The main idea of the new scheme may be described as follows. We group letters with small probabilities in subsets (acting as super letters) and use time consuming coding for these sub ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We address the problem of constructing a fast lossless code in the case when the source alphabet is large. The main idea of the new scheme may be described as follows. We group letters with small probabilities in subsets (acting as super letters) and use time consuming coding
Alphabetic Coding with Exponential Costs
, 2009
"... ∑ n i=1 w(i)al(i) for a given An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing ∑n i=1 w(i)l(i), this variant in ..."
Abstract
 Add to MetaCart
∑ n i=1 w(i)al(i) for a given An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing ∑n i=1 w(i)l(i), this variant
Hidden Markov processes
 IEEE Trans. Inform. Theory
, 2002
"... Abstract—An overview of statistical and informationtheoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discretetime finitestate homogeneous Markov chain observed through a discretetime memoryless invariant channel. In recent years, the work of Baum and Petrie on finite ..."
Abstract

Cited by 264 (5 self)
 Add to MetaCart
state finitealphabet HMPs was expanded to HMPs with finite as well as continuous state spaces and a general alphabet. In particular, statistical properties and ergodic theorems for relative entropy densities of HMPs were developed. Consistency and asymptotic normality of the maximumlikelihood (ML) parameter
The LOCOI Lossless Image Compression Algorithm: Principles and Standardization into JPEGLS
 IEEE TRANSACTIONS ON IMAGE PROCESSING
, 2000
"... LOCOI (LOw COmplexity LOssless COmpression for Images) is the algorithm at the core of the new ISO/ITU standard for lossless and nearlossless compression of continuoustone images, JPEGLS. It is conceived as a "low complexity projection" of the universal context modeling paradigm, match ..."
Abstract

Cited by 253 (11 self)
 Add to MetaCart
for capturing highorder dependencies. The model is tuned for efficient performance in conjunction with an extended family of Golombtype codes, which are adaptively chosen, and an embedded alphabet extension for coding of lowentropy image regions. LOCOI attains compression ratios similar or superior to those
About Adaptive Coding on Countable Alphabets
, 2012
"... This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and nondecreasing hazard rate. We prove that the autocensuring (AC) code introduced by Bontemps (2011) is adaptive with respect to the coll ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and nondecreasing hazard rate. We prove that the autocensuring (AC) code introduced by Bontemps (2011) is adaptive with respect
Tackling realcoded genetic algorithms: operators and tools for the behavioural analysis
 Arti Intelligence Reviews
, 1998
"... Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the natural evolution prin ..."
Abstract

Cited by 198 (27 self)
 Add to MetaCart
principles of populations. These algorithms process a population of chromosomes, which represent search space solutions, with three operations: selection, crossover and mutation. Under its initial formulation, the search space solutions are coded using the binary alphabet. However, the good properties
Results 1  10
of
1,248