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.
Multiple Cell Upsets (MCUs) induced by ionizing radiation in memories are becoming more likely to happen due to the continuous technology scaling down. Error Correction Codes (ECCs) are applied for recovering the stored information into its original state providing reliable computer systems. Several ECC are able to deal with MCUs, however, the higher the robustness of an ECC, more area, and energy...
The present work describes the PPM — Prediction by Partial (string) Matching algorithm for lossless compression of text. It studies the procedure of extending the source alphabet for the PPM encoding in order to allow using of symbols not yet present in the source alphabet at the very beginning of the process of text encoding. The work describes the procedure of extending the alphabet and presents...
We construct permutation codes capable of correcting bursts of stable deletions. For correcting a single burst of exactly s stable deletions, our code has size sn!/((2s)!n)2 while the upper bound is n!/s!(n − s + 1). We also construct permutation codes for the cases of single burst of up to s stable deletions, and up to b bursts of at most s stable deletions each.
We consider a joint source-channel decoding (JSCD) problem where the source encoder leaves residual redundancy in the source. We first model the redundancy in the source encoder output as the output of a side information channel at the channel decoder, and show that this improves random error exponent. Then, we consider the use of polar codes in this framework when the source redundancy is modeled...
In this work, we establish the pointwise optimality of side information version of SWLZ algorithm for stationary ergodic sources. We also obtain a pointwise upper bound on the redundancy rate of this side information version of SWLZ algorithm for a subclass of φ-mixing sources, which includes Markov sources as a special case. This upper bound obtained differs only by a constant factor from the best...
Variable-length codes with incremental redundancy controlled by feedback allow a system to approach capacity with short average blocklengths and thus relatively low-complexity decoders. This paper shows how to use those same variable-length codes with incremental redundancy to approach capacity without feedback. The general principle is to provide a common pool of redundancy that can be accessed by...
We consider the problem of constructing codes that can correct δ deletions occurring in an arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions (δ = 1) with an asymptotically optimal redundancy. Finding similar codes for δ ≥ 2 deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) codes, that...
This paper uses a case study of a tail-biting convolutional code (with successful decoding indicated by the reliability output Viterbi algorithm) to present an information density approach for analyzing and optimizing the throughput of systems using incremental redundancy controlled by feedback. Polyan-skiy's normal approximation combined with a linear model for the information gap of a rate-compatible...
Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their applicability to enable random access in DNA storage. In this work we follow the research of Yazdi et al. and study MU codes along with their extensions to correct errors...
The problem of constructing sticky-insertion-correcting codes with efficient encoding and decoding is considered. An {n, M, r) sticky-insertion-correcting code consists of M codewords of length n such that any pattern of up to r sticky insertions can be corrected. We utilize BCH codes and their analogous in the Lee space to construct explicit and systematic codes that are immune to up to r sticky...
We design polar codes of blocklength n→∞ and code rate R →1 that achieve the vanishing output error rates on the binary symmetric channels with transition error probability p → 0. These codes have a substantially smaller redundancy order (1 − R)n than do other known high-rate codes, such as Reed-Muller (RM) or BCH codes. The construction is explicit and has complexity of order nlog n. We also design...
Coded computation is a framework for providing redundancy in distributed computing systems to make them robust to slower nodes, or stragglers. In [1], the authors propose a coded computation scheme based on maximum distance separable (MDS) codes for computing the product ATB, and this scheme is suitable for the case where one of the matrices is small enough to fit into a single compute node. In this...
We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably better than those of previous work. Still, the resources required by our technique remain modest: there is no need for costly calculations using large...
We focus on the design of an encoded symbol degree distribution for Systematic Rateless Codes to be used for achieving fault tolerance in distributed storage systems. Major performance metrics for distributed storage codes are low repair locality, low encoding/decoding complexity and systematic encoding. In this work, we first evaluate the role of different encoded symbol degrees in ensuring low decoding...
Scaling of CMOS technology to nanoscale increases soft error rate in memory cells. Both single bit upset and Multiple Cell Upsets (MCUs) causes reliability issues in memory applications. Transient multiple cell upsets (MCUs) are becoming major issues in the reliability of memories exposed to radiation environment and affect large number of cells. Hence to provide fault tolerant memory cells, Error...
NAND flash memory has decreasing storage reliability, as the density or program/erase (P/E) cycle increases. To ensure data integrity, error correction codes (ECCs) are widely employed and typically stored in the out-of-band area (OOB) of flash pages. However, the worst-case oriented ECC is largely under-utilized in the early stage (small P/E cycles), and the required ECC redundancy may be too large...
As CMOS technology scales down, multiple cell upsets (MCUs) caused by a single radiation particle have become one of the most challenging reliability issues for memories in space applications. In general, bits affected by MCUs are usually physically close. Error correction codes (ECCs) are commonly used to protect memory against MCUs. Recently, Matrix-based codes are an interesting option due to their...
Multipath TCP (MPTCP) is a promising extension of TCP to spread data across several subflows enabling multiple path support. Like TCP, MPTCP suffers from performance degradation when deployed in wireless networks. It tends to interpret random link losses as congestion signals. Yet, the protocol is showcased for handheld devices with multiple radios to enable throughput aggregation and seamless handover...
This article is described to research of noise stability providing different methods of data communication net-works as a part of control systems. Importance and significance of redundancy encoding and feedback for pro-viding reliable information transfer between elements and devised of control systems are showing. The analytic methods of redundancy codes (Reed-Solomon and convolution) construction,...
SSD Technology is used to read/write data to the external device with high speed and low power. A lossless LZ77 data compression technique is used here in order to retain the information content by removing data redundancy and also employs a text window in congestion with look-ahead buffer to serve as a dictionary. In the proposed technique the unmatched string present in the dictionary are encoded...
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.