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.
Nearly tight lower and upper bounds on the capacity of generalized Ising channels are presented. For the case where feedback is allowed, a closed-form expression for the capacity is found for channel error probability p ∈ [0, p0], where p0 ≈ 0.398324. Two lower bounds on that capacity for larger values of p are presented.
Improved bounds on the rates of grain-correcting codes are presented. The lower bounds are Gilbert-Varshamov-like ones combined with a construction by Gabrys et al.; additionally, two asymptotically equivalent upper bounds are presented. Both the lower and the upper bounds improve on the previously known results for certain ranges of parameters. Constructions of 1-grain-correcting codes which are...
This paper studies new bounds and constructions that are applicable to the combinatorial granular channel model previously introduced by Sharov and Roth. The main theme of the paper is that codes capable of correcting grain-errors are related to codes that correct insertions/deletions and codes that correct asymmetric errors. Using this insight, new bounds on the maximum cardinality of a grain-error...
HTTP streaming recently emerges on Internet, and is conveniently accessed from multiple kinds of platforms. It lowers complexity for implementing media streaming applications by relying on pervasively adopted web servers. The media content is divided into segments of the fixed time intervals before being independently requested by clients. This paper studies choices of these fixed time intervals,...
We study a model of errors in binary data that arises in terabit-density magnetic recording. Under this model, several bits of the data are replaced by the values of their neighbors on the medium. We consider a simple one-dimensional version of this model, and derive several properties of codes that correct this type of error.
We consider data-streaming from an access point to multiple receivers, which is modeled as packet erasure channel. A simple network coding is shown to achieve larger rate region than without network coding, using minimal control information. The performance is characterized exactly using state transition graph. The scheme is then mapped to an information theoretic formulation for broadcast channel...
This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.
Video-streaming can now be offered on third-generation (3G) mobile networks. Most research efforts have focused on video download. This paper presents a detailed study of challenges faced for successfully deploying applications requiring life video upload. Both subjective and objective qualities as well as the effects of mobility are analyzed on real 3G networks. Consequently, video profiles are identified...
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.