Symbol-pair codes were introduced by Cassuto and Blaum in 2010 to protect pair errors symbol-pair read channels. Recently Yaakobi, Bruck Siegel (2016) generalized this notion b-symbol order consider consecutive b for a prescribed integer ? 2, they gave constructions decoding algorithms. Cyclic considered various authors as candidates established minimum distance bounds on (certain) cyclic codes...

A system for dynamic compilation under the Unix operating system is described. The basis of the system is an incremental assembler that can be used statically or during program execution to insert or replace a module in an executable image. All cross-module references are via offsets into a run-time symbol table. All generated code is independent of its location or the location of the symbol ta...

In this report we firstly propose a block-code based general model to combat the Inter-Symbol Interference (ISI) caused by frequency selective channels in a Multi-Input Multi-Output (MIMO) system and/or by asynchronous cooperative transmissions. The general model is not only exemplified by the TimeReversed Space-Time Block Code (TR-STBC) scheme, but also by the Asynchronous Cooperative Liner Di...

In this paper, we discuss the difference in code lengths between the code based on the minimum description length (MDL) principle (the MDL code) and the Bayes code under the condition that the same prior distribution is assumed for both codes. It is proved that the code length of the Bayes code is smaller than that of the MDL code by (1) or (1) for the discrete model class and by (1) for the pa...

Akhsrract --In the information theory of the multiple-access channel, two types of synchronism are usually assumed among the transmitters, namely, frame and symbol synchronism. Frame synchronism refers to the ability of the users to start the transmission of their codewords in unison. The issue of symbol synchronism arises in continuous-time channels in which each codeword symbol modulates a fi...

In magnetic recording channels, a standard code architecture consists of an outer Reed-Solomon code in concatenation with an inner parity code. The inner parity code is used to detect and correct commonly occurring error events. Generally, a parity code with short block length performs better, as multiple error events within one block and, consequently, miscorrection are less likely. In this pa...

This report documents the results of a preliminary study on the application of various modulation and forward error control (FEC) techniques for application to wireless local area networks (WLAN) applications. The report considers the existing quadrature phase shift keying (QPSK) -Barker code based system. The notion of bandwidth and signal to noise ratios Es/No and Eb/No are reviewed. It is sh...

Generalized pair weights of linear codes are generalizations minimum symbol-pair weights, which were introduced by Liu and Pan (2022) recently. can be used to characterize the ability protecting information in read wire-tap channels type II. In this paper, we introduce notion generalized <...

In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be recovered with high probability by reading N symbols from the corrupted codeword, where N is the block-length of the code. Expander codes, introduce...

Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum distance is of significance determining the error-correcting capability a code. One central themes coding theory constructions with largest possible distance. Maximum separable (MDS) and almost maximum (AMDS) optimal sub-optimal regarding Singleton bound, respectively. In this paper, six new cl...