The use of a set of "xed permutations has recently been proposed for peak-to-average power ratio (PAR) reduction of an OFDM signal [ I ] . Sending the identity of the used permutation to the receiver reliably is critical in this method. This paper presents the use of data permutation with embedded side information (SI) to reduce the PAR of an OFDM signal. SI is coded using a simple forwarderror...

Space-Time Frequency (STF) codes for MIMO-OFDM over block-fading channel can achieve rate Mt and full-diversity Mt Mr Mb L which is the product of the number of transmit antennas Mt, receive antennas Mr, fading blocks Mb and channel taps L. In this article, time permutation is proposed to provide independent block-fading over Jake’s Doppler power spectrum channel. Moreover, we show the performa...

The resistance of an iterated block cipher to most classical attacks can be quantified by some properties of its round function. The involved parameters (nonlinearity, degrees of the derivatives...) for a function F from F2 into F2 are related to the weight distribution of a binary linear code CF of length 2 − 1 and dimension 2m. In particular, the weight divisibility of CF appears as an import...

Several high performance LDPC codes have parity check matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code in this large family to a hardware emulation platform. A peak throughput of 240Mb/s is achieved in decoding the (2048,1723) Reed-Solomon based LDPC (RS-LDPC) code. Experiments in the low bit error rate (BER) r...

The covering radius problem is a question in coding theory concerned with finding the minimum radius r such that, given a code that is a subset of an underlying metric space, balls of radius r over its code words cover the entire metric space. Klapper ([13]) introduced a code parameter, called the multicovering radius, which is a generalization of the covering radius. In this paper, we introduc...

Of course, cryptography is necessary for a project such as the data haven, and, as the title would imply, discussions of codes and ciphers run throughout the book. Mathematicians with a background in cryptanalysis might be especially interested in a new output-feedback mode stream cipher formally introduced in this book for the first time. The code is described in greater detail in an appendix ...

this paper presents a new audio encryption algorithm based on permutation and residue number system. in the current approach, signal samples are combined with residue number system through permutation; therefore, a specific noise is generated. then, the audio signal is combined with the noise, generated by the algorithm, to produce a silence signal. for this purpose, the algorithm uses a predef...

Activation Codes are used in many different digital services and known by many different names including voucher, e-coupon and discount code. In this paper we focus on a specific class of ACs that are short, human-readable, fixed-length and represent value. Even though this class of codes is extensively used there are no general guidelines for the design of Activation Code schemes. We discuss d...

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

The hull of a linear code is defined to be the intersection and its dual. When size small, it has been proved that some algorithms for checking permutation equivalence two codes computing automorphism group are very effective in general. Maximum distance separable (MDS) meeting Singleton bound. Twisted Reed-Solomon generalization codes, which also nice construction MDS codes. In this short lett...