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...
As a distributed storage system with regenerating function of failed nodes, regenerating codes have been studied recently. In a [n, k, d]-regenerating codes framework, a message can be reconstructed from any subsets of k nodes out of n nodes and any failed nodes can be repaired from any subsets of d nodes out of (n − 1) nodes. The conditions of the reconstruction and regeneration can be generalized...
Cooperative regenerating codes are a class of codes that enable a data collector to reconstruct the original data by connecting to a subset of storage nodes, and also can repair multiple failed nodes by downloading data from the surviving nodes and exchanging data among the new nodes. In cooperative regenerating codes, there exists a tradeoff between the storage size of each node and repair-bandwidth...
This paper treats the problem of lossless fixed-to-variable length source coding under the criterion of the overflow probability. We investigate the behavior of the overflow probability of the Bayes code in the moderate deviation regime. Our result clarifies that the behavior of the overflow probability of the Bayes code is the same as that of the optimal non-universal code in the moderate deviation...
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...
The objective of this research is to evaluate the ε-minimum overflow threshold of the Bayes codes for a Markov source. In the lossless variable-length source coding problem, typical criteria are the mean codeword length and the overflow probability. The overflow probability is the probability with which a codeword length per source symbol exceeds a threshold and the ε-minimum overflow threshold is...
Recently, computing the capacity region of the degraded broadcast channel (DBC) was showed as a nonconvex optimization problem by Calvo et al. There seems to be no efficient method to solve in polynomial time due to the lack of convexity. In other nonconvex optimization problem, however, Kumar et al showed that Arimoto-Blahut type algorithm converges to the global optimum when some conditions hold...
In this paper, we present an iterative algorithm for computing the secrecy capacity of broadcast channel with confidential message (BCC) in the situation that the main channel is less noisy than the eavesdropper's channel. The global convergence of the algorithm is proved, and an expression for its convergence rate is derived.
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.