We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity for a fixed permutation of the code. We examine constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code. We identify the primitive structures that can appear in a minimal trellis and relate this to those for the ...

Proof. Let C be a binary code with minimum relative distance δ. Suppose x ∈ {0, 1} is arbitrary and c1, c2, . . . , cL ∈ C are codewords such that for all i, ∆ (x, ci) < ρn. Since each ci is a codeword, we have that ∆ (ci, cj) ≥ δn for all i 6= j. Let Φ : {0, 1} → Rn be the map sending 0 to 1 and 1 to −1. Define u = Φ (x), and, for all i, define vi = Φ (ci). Let ū = 1 √ n u denote the normaliza...

Turbo codes, in the form of parallel concatenated convolutional codes, consist of two recursive systematic convolutional encoders separated by an interleaver. Due to the presence of the interleaver, each constituent convolutional encoder accepts as input a block of information bits with a size equal to that of the interleaver rather than a continuous stream of information bits. By determining t...

Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. An error exponent and decoding complexity for tail biting random trellis codes are shown. Then we propose a block concatenated code constructed by a tail biting trellis inner code and derive an error exponent and decoding complexity for the proposed code. The results obtained by the proposed code ...

MP3Stego is a typical steganographic tool for MP3 audio, which embeds secret message into MP3 audio according to the parity of the block length. In this work, we present a steganalytic method to attack MP3Stego. The big_values inside information is considered to extract the steganalytic feature. Re-compression calibration has been applied in order to improve the feature's sensitivity. Experimen...

We present some results on almost maximum distance separable (AMDS) codes and Griesmer codes of dimension 4 over F5. We prove that no AMDS code of length 13 and minimum distance 5 exists, and we give a classification of some AMDS codes. Moreover, we classify the projective strongly optimal Griesmer codes over F5 of dimension 4 for some values of the minimum distance.

A t-(v; k;) design D is a system (multiset) of k-element subsets (called blocks) of a v-element set V such that every t-element subset of V occurs exactly times in the blocks of D. A t-(v; k;) design D is called inde-composable (or elementary) if and only if there is no subsystem which is a t-(v; k; 0) design with 0 < 0 <. It is known that the number of inde-composable designs for given paramet...

In this paper, we will provide an algorithm which allows us to find a BCK-algebra starting from a given binary block code.

Woven codes with outer binary block codes and additional permutation are presented. This enables the construction of a new class of woven block codes, where the minimum distance is about twice the product of the minimum distances of the component codes.

A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths,...