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.
Variable-length source coding with side information allowing a nonzero decoding error probability ε is considered. For the case where the side information is available at both of the encoder and decoder, we give an explicit formula of the rate-error function Rc(ε) for the mixture of i.i.d. sources. For the case where the side information is available only at the decoder, we concentrate our attention...
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.
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...
The construction of a channel code by using a source code with decoder side information is introduced. For the construction, any pair of encoder and decoder is available for a source code with decoder side information. A constrained-random-number generator, which generates random numbers satisfying a condition specified by a function and its value, is used to construct a stochastic channel encoder...
We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data obtained at the decoder was determined by Wyner and Ziv. In this paper, we study the error probability of decoding at rates below the rate distortion function. We...
Sudoku is a pencil puzzle. The aim of the solver is to complete the 9×9 grid by filling in a digit in every cell in a certain rule. In this study, we regard the process of solving Sudoku as a process of decoding a codeword from a received word, and show the expected decoding error probability obtained by experiments for erasure channels.
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 deals with one-shot fixed-to-variable length source coding allowing error probability. We adopt the criterion of the overflow probability and treat prefix and non-prefix codes. The infimum of the threshold of the overflow probability is investigated under the condition that the error probability and the overflow probability are bounded above by positive constants. We show this threshold...
In this paper a minimum distance detector is implemented for the first time, to decode equiprobable ultra-wide band (UWB) chipless radio frequency identification (RFID) tags in an additive white Gaussian noise (AWGN) channel. The coding of the UWB chipless tags is performed by changing the position of the resonance dip in order to increase the Euclidean distance (ED) between different codes. Four...
We propose and design a lattice coded physical- layer network coding (PNC) over a finite complex number field Z[ω]/ξZ[ω] in a two-way relay channel (TWRC). In our design, we construct the lattice codes from an irregular repeat- accumulate (IRA) code over GF(q). A randomly generated coset is employed to our scheme to ensure that the codes exhibit permutation invariance and...
In modern communication systems, there is content redundancy inside the transmitted data no matter what source codes are adopted. This paper introduces machine learning method to utilize content redundancy and perform content recognition, in order to provide side information for error control coding (ECC) and improve performing. It shows that content recognition for English text, based on Trie and...
Multithreshold decoding algorithms for self-orthogonal error-correction codes have been considered. Analytical estimations of their efficiency in the uncorrelated Rayleigh and Rician channels have been represented. Results of the computer simulation have been obtained. Possibilities to apply multithreshold decoders in combination with such technologies of the efficiency increase of data transmission...
We consider the problem of distributed binary hypothesis testing of two sequences that are generated by a doubly binary symmetric source. Each sequence is observed by a different terminal. The two hypotheses correspond to different levels of correlation between the two source components, i.e., the i.i.d. probability of the difference between the two sequences. The terminals communicate with a decision...
The problem of distributed function computation for the class of smooth sources is studied, where functions to be computed are compositions of symbol-wise functions and some outer functions that are not symbol-wise. The optimal rate for computing those functions is characterized in terms of the Slepian-Wolf rate and an equivalence class of sources induced by functions. To prove the result, a new method...
We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC). For the VLF setup, the achievability bound relies on a scheme that maps each message onto a variable-length Huffman...
Lattices from Construction A and non-binary codes are considered. These lattices are built from number fields as coset codes of the ring of integers OK modulo an ideal I. Diversity of a Construction-A lattice Λ on block-fading channels is guaranteed by the chain Im ⊂ Λ ⊂ OKm. We study how the code alphabet size should be chosen in order to avoid error floors on the Gaussian channel due to the sublattice...
In this paper, amended truncated union bounds on the bit error probability of systematic linear codes over additive white Gaussian noise (AWGN) channels are proposed. The proposed bounds are based on Gallager's first bounding technique (GFBT), where the “good” region is defined by a suboptimal list decoding algorithm. The proposed bounds require only the knowledge of partial input output weight enumerating...
The principles of construction of Reed-Solomon codes are examined. Analysis of the basic parameters of the codes was perfomed. Comprehensive assessment of correcting abilities of the code along with the information efficiency is made. Performed a comparison of efficiency of Reed-Solomon codes in telecommunication networks compared to binary codes which have equivalent parameters.
Space-based Automatic Identification System (AIS) uses Gaussian minimum shift keying modulation (GMSK) as the modulation scheme. Thus, Viterbi Algorithm (VA) is commonly implemented considering the tradeoff between performance and complexity. For the further improvement of the performance of Viterbi decoding, we propose a Soft-Output Viterbi Algorithm for AIS receiver (SOVA-AIS) in this paper. The...
In this paper, we establish the ε-capacity region for the AWGN multiple access channel (MAC) with feedback under an expected power constraint by combining ideas from binary hypothesis testing, information spectrum analysis, Ozarow's coding scheme, and power control.
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.