The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.

In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure double circulant i.e. could not be represented in systematic form. Keywords—convolutional encoding, quasi-cyclic codes weight enumeratorg, double circulant

In this paper the low density party check (LDPC) codes used in the IEEE 802.16 standard physical layer are studied, and two novel techniques to enhance the performance of such codes are introduced. In the first technique, a novel parity check matrix for LDPC codes over GF(4) with the non-zero entries chosen to maximize the entropy is proposed, the parity check matrix is based on the binary pari...

In this article we advance a distinctly relational view of negotiation. We delineate the conditions through which relational self-construals (RSC) become accessible in negotiations and the conditions that inhibit their use, and we illustrate mechanisms through which RSC affects negotiation processes and outcomes. We introduce four relational dynamics—arelational trading, relational satisficing,...

Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use methods from systems theory to characterize maximum distance profile codes algebraically. The main r...

-Viterbi decoder is a basic and important block in any Code Division Multiple Access (CDMA) and CDMA uses Convolutional encoder to prevent Interference. Convolutional encoding and Viterbi decoding are widely used in various communication systems because of their excellent error control performance. This paper deals with the implementation of Convolutional encoding and Viterbi decoding using SOP...

Please note that technical editing may introduce minor changes to the text and/or graphics, which may alter content. The journal’s standard Terms & Conditions and the Ethical guidelines still apply. In no event shall the Royal Society of Chemistry be held responsible for any errors or omissions in this Accepted Manuscript or any consequences arising from the use of any information it contains. ...

We propose a trellis-coding scheme for which large free distances and low decoding complexities can be easily achieved. The proposed trellis-coding scheme is a generalization of the trellis-coding scheme proposed by Hellstern. With the proposed trellis-coding scheme, we have the flexibility of controlling the decoding delay.

State Key Laboratory of Coal Conversion Academy of Sciences, Taiyuan, Shanxi, 0300 State Key Laboratory of Heavy Oil Processin 102249, China Department of Physics and Mathematics, U del Charro Ave. Cd, Juárez, Mexico, 32310 Nuclear Engineering and Radiological Scien 48109-2104, USA Department of Physics, Berea College, Bere Department of Chemistry, University of Cal Synfuels China Co. Ltd., Hua...

Communication Theory Mini Conference Globecom 97 Towards Optimality in Constellation Labeling Richard D. Wesel, Christos Komninakis, and Xueting Liu University of California, Los Angeles, CA 90095-1594 Abstract Robust trellis codes that perform well on channels with severe, correlated fading require low rates and do not employ uncoded (pass-through) bits. For this trellis code design problem, n...