The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed...
The biometrical identification system, introduced by Willems et al., is a system to identify individuals based on measurable physical characteristics of each individual. One of the most important factors on this system is the identification capacity, i.e. the maximum achievable rate of the number of individuals that can be distinguished with a vanishing error probability asymptotically. Willems et...
We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ε. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source...
This paper investigates the first- and second-order maximum achievable rates of codes with/without cost constraints for mixed channels whose channel law is characterized by a general mixture of (at most) uncountably many stationary and memoryless discrete channels. These channels are referred to as mixed memoryless channels with general mixture and include the class of mixed memoryless channels of...
This paper studies the first- and second-order maximum achievable rates of codes with/without cost constraints for general mixed channels whose channel law is characterized by a mixture of uncountably many stationary and memoryless discrete channels. These channels are referred to as general mixed memoryless channels and include mixed memoryless channels of finitely or countably many memoryless channels...
For a class of mixed channels that are decomposed into finitely many stationary memoryless channels, the optimum second-order coding rate, or equivalently, channel dispersion, is derived. The addressed channel, which is an instance of non-ergodic channels, is a sub-class of regular decomposable channels introduced by Winkelbauer. The second-order coding theorem can be viewed as an extension of the...
Refined bounds on the probability of decoding error for arbitrary multiple-access channels with correlated sources are derived. The contribution of this paper is to give new upper bounds on the probability of decoding error for any given blocklength. These bounds can be used for the analysis over any multiple-access channels with correlated and uncorrelated sources in the finite blocklength regime...
An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decoding algorithm. By propagating messages of two punctured bits sum, this algorithm can recover much more...
The concatenation of an arbitrary discrete memoryless channel with binary input followed by a quantizer is considered. For a restricted quantizer alphabet size, it is shown that the maximum of the mutual information between the channel input and the quantizer output can be found by dynamic programming. Numerical examples are given to illustrate the results. This problem is shown to be an example of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.