Erasure codes have become an integral part of distributed storage systems as a tool for providing data reliability and durability under the constant threat device failures. In such systems, [ n, k ] code over finite field F q encodes ...

This paper presents Pyramid code, an optimal code for transmitting sequential addresses over a DRAM bus. Constructed by finding an Eulerian cycle on a complete graph, this code is optimal for conventional DRAM in the sense that it minimizes the switching activity on the time-multiplexed address bus from CPU to DRAM. Experimental results on a large number of testbenches with different characteri...

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. ...

We propose an iterative design algorithm for jointly optimizing source and channel codes. The joint design combines channel-optimized vector quantization (COVQ) for the source code with rate-compatible punctured convolutional (RCPC) coding for the channel code. Our objective is to minimize the average end-to-end distortion. For a given channel SNR and transmission rate, our joint source and cha...

Code smells reflect sub-optimal patterns of code that often lead to critical software flaws or failure. In the sameway, community smells reflect sub-optimal organisational and socio-technical patterns in the organisational structure of the software community. To understand the relation between the community smells and code smells we start by surveying 162 developers of nine opensource systems. ...

Let G(V,E) be a simple, undirected graph. An identifying code on G is a vertex-subset C ⊆ V such that B(v) ∩ C is non-empty and distinct for each vertex v ∈ V , where B(v) is a ball about v. Motivated by applications to fault diagnosis in multiprocessor arrays, a number of researchers have considered the problem of constructing identifying codes of minimum density on various two-dimensional lat...

This paper considers the transmission of an infinite sequence messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at destination subject to fixed decoding delay. While capacity channel that introduces only bursts erasures has been known for more than fifteen years, recently, with either one burst or multiple arbitrary in any fixed-...

Carrier-phase smoothing code (CPSC) is a code-smoothing technology that uses carrier-phase changes to reduce noise in Global Navigation Satellite System (GNSS) appliances. Although CPSC performs well reducing and easy implement, it trade-off between the reduction of increase variation ionospheric errors. The width window needs be large noise. However, wider increases To circumvent this dilemma,...

Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based on analogies with model predictive optimal control, we propose a new iterative method for convolutional decoding that is cheaper to implement than establish...

The genetic code markup is the assignment of stop codons. The standard genetic code markup ensures the maximum possible stability of genetic information with respect to two fault classes: frameshift and nonsense mutations. There are only 528 (about 1,3% of total number) optimal markups in the set of markups having 3 stop codons. Among the sets of markups with 1,2…8 stop codons, the standard cas...