In this note, we prove that if C is a duadic binary abelian code with splitting µ = µ-1 and the minimum odd weight of C satisfies d² - d + 1 ≠ n, then d(d-1) ≥ n + 11. We show by an example ...

In this paper we propose a novel lightweight approximate authentication algorithm that provides efficient protection for wireless video streaming where bit errors are frequent. The benefits of the proposed algorithm over other algorithms are fast execution, ...

This paper describes the salient features of designing a robust forward error correction coding scheme for satellite data communications and considers various such schemes suitable for a short message application.

This paper investigates the performance of image transmission with unequal error protection (UEP) through typical satellite communication channel, and the UEP is achieved by mapping different bits of the image bytes to different positions of a progressive ...

Authentication codes have been developed since 1974, while error correcting codes have a longer history. There are several approaches to the construction of authentication codes without secrecy using error correcting codes. In this thesis, we present ...

Let p be a prime number and assume p ¿ 5. We will use a result of L. Redéi to prove, that every perfect 1-error correcting code C of length
Keywords: 94B25, Perfect codes, Redei Theorem

The main purpose of this paper is to decode the binary Reed-Muller [32,16,8] code R(2,5) by hand by two methods. One, the representation decoding method, is the analogue of the method used to decode the Golay code [8]. The other is the syndrome ...

In this paper, error-resilient schemes are proposed to support robust video transmission for digital terrestrial TV broadcasting (DTTB). In particular, a temporal error concealment incorporated with a low-complexity block-matching is developed, achieving ...

Reed-Solomon (RS) codes are widely used to identify and correct errors in transmission and storage systems. When RS codes are used for high reliable systems, the designer should also take into account the occurrence of faults in the encoder and decoder ...

Space-time differential coding (STDC) is an effective technique for exploiting transmitter diversity while it does not require the channel state information at the receiver. However, like conventional differential modulation schemes, it exhibits an error ...

Fibre Channel (FC) is a high performance, low- latency data transfer technology that dominates today's high-end Storage Area Networks (SAN) market. This paper presents the design and implementation of Fibre Channel FC-1 and part of FC-2 layer for multi- ...

Parity prediction schemes have been widely studied in the past. Recently, it has been demonstrated that this prediction scheme can achieve Fault-Secureness in arithmetic circuits for stuck-at and stuck-open faults. For most cryptographic applications, ...

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m=\{0,1,\ldots,m-1\} is a block code over {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m such that each alphabet symbol occurs as many times ...

Gray codes, where two consecutive codewords differ in exactly one position by $\pm 1$,are given. In a single radix code, all dimensions have the same base, say $k$, whereas in a mixed radix code the base in one dimension can be different from the base ...

We research on an importance sampling (IS) simulation to estimate a low error probability of turbo codes. The simulation time reduction in IS depends on another probability density function (p.d.f.) called simulation p.d.f. The previous IS simulation ...

The subject of this paper is the design and evaluation of an efficient error control scheme for indoor cellular wireless broadband access networks, which can be considered as the wireless extension of a fixed quality-of-service oriented network (e.g., ...

Long Bose-Chaudhuri-Hocquenghen (BCH) codes are used as the outer error correcting codes in the second-generation Digital Video Broadcasting Standard from the European Telecommunications Standard Institute. These codes can achieve around 0.6-dB additional ...

All Boolean variables here range over the two-element set {-1, 1}. Given n Boolean variables $x_{i},\ldots , x_{n}, a nonmonotone MAJORITY gate (in the variables $x_{i}$) is a Boolean function whose value is the sign of $\sum^{n}_{i=1} \varepsilon_{i} ...