International Journal of Information and Coding Theory http://www.inderscience.com/browse/index.php?journalID=253&year=2011&vol=2&issue=1 Inderscience Publishers Ltd en-uk International Journal of Information and Coding Theory 1753-7703 1753-7711 © 2011 Inderscience Publishers Ltd editor@inderscience.com https://www.inderscience.com/images/files/coverImgs/ijicot_scoverijicot.jpg http://www.inderscience.com/browse/index.php?journalID=253&year=2011&vol=2&issue=1 http://www.inderscience.com/link.php?id=44675 A new class of cyclic codes of length 2<SUP align="right">n</SUP> over GF(q) is proposed, where q is a prime of the form 8m ± 3 and n > 3 is an integer. These codes are defined in terms of their generator polynomials. These codes have many properties analogous to those of duadic codes. Generator polynomials of some duadic codes of length p<SUP align="right">n</SUP> over GF(q) are also discussed, where p is an odd prime, n is an integer and q = ρ or ρ² for some prime ρ. Some cyclic codes of prime-power length
Sudhir Batra; S.K. Arora
International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 1 - 9
A new class of cyclic codes of length 2<SUP align="right">n</SUP> over GF(q) is proposed, where q is a prime of the form 8m ± 3 and n > 3 is an integer. These codes are defined in terms of their generator polynomials. These codes have many properties analogous to those of duadic codes. Generator polynomials of some duadic codes of length p<SUP align="right">n</SUP> over GF(q) are also discussed, where p is an odd prime, n is an integer and q = ρ or ρ² for some prime ρ.

]]> 10.1504/IJICOT.2011.044675 International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 1 - 9 Sudhir Batra; S.K. Arora Department of Mathematics, T.I.T. & S., Birla Colony, Bhiwani 127021, India ' Department of Mathematics, Maharshi Dayanand University, Rohtak 124001, India cyclic codes generator polynomials duadic codes qr codes prime power length. 2012-01-02T23:20:50-05:00 2 1 1 9 2012-01-02T23:20:50-05:00 http://www.inderscience.com/link.php?id=44674 In this paper, we study a special type of linear codes, called skew cyclic codes, in the most general case. This set of codes is a generalisation of cyclic codes but constructed using a non-commutative ring called the skew polynomial ring. In previous works, these codes have been studied with certain restrictions on their length. This work examines their structure for an arbitrary length without any restriction. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes, hence establish strong connections with well-known classes of codes. Skew cyclic codes of arbitrary length
Irfan Siap; Taher Abualrub; Nuh Aydin; Padmapani Seneviratne
International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 10 - 20
In this paper, we study a special type of linear codes, called skew cyclic codes, in the most general case. This set of codes is a generalisation of cyclic codes but constructed using a non-commutative ring called the skew polynomial ring. In previous works, these codes have been studied with certain restrictions on their length. This work examines their structure for an arbitrary length without any restriction. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes, hence establish strong connections with well-known classes of codes.

]]> 10.1504/IJICOT.2011.044674 International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 10 - 20 Irfan Siap; Taher Abualrub; Nuh Aydin; Padmapani Seneviratne Department of Mathematics, Y?ld?z Technical University, Istanbul, Turkey ' Department of Mathematics and Statistics, American University of Sharjah, Sharjah, UAE ' Department of Mathematics, Kenyon College, Gambier, OH, USA and Qafqaz University, Baku, Azerbaijan ' Department of Mathematics and Statistics, American University of Sharjah, Sharjah, UAE skew cyclic codes quasi-cyclic codes equivalent codes linear codes arbitrary lengths. 2012-01-02T23:20:50-05:00 2 1 10 20 2012-01-02T23:20:50-05:00 http://www.inderscience.com/link.php?id=44676 All binary self-dual [44, 22, 8], codes with an automorphism of order 3 or 7 are classified. In this way, we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order. On the classication of binary self-dual [44, 22, 8] codes with an automorphism of order 3 or 7
Stefka Bouyuklieva; Nikolay Yankov; Radka Russeva
International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 21 - 37
All binary self-dual [44, 22, 8], codes with an automorphism of order 3 or 7 are classified. In this way, we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

]]> 10.1504/IJICOT.2011.044676 International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 21 - 37 Stefka Bouyuklieva; Nikolay Yankov; Radka Russeva Department of Mathematics and Informatics, Veliko Tarnovo University, 5000 Veliko Tarnovo, Bulgaria ' Faculty of Mathematics and Informatics, Shumen University, Shumen, Bulgaria ' Faculty of Mathematics and Informatics, Shumen University, Shumen, Bulgaria binary self-dual codes self-orthogonal codes automorphisms classification. 2012-01-02T23:20:50-05:00 2 1 21 37 2012-01-02T23:20:50-05:00 http://www.inderscience.com/link.php?id=44677 Video conference is an attractive and promising application which allows immersive communication and discussion among people at different and distant places. However, its stringent delay and bandwidth requirements limit its scale and spread over current internet. This paper attempts to introduce the prosperous technology of network coding (NC) into video conference to minimise the maximal transmission delay between source and all the participants while retaining high bandwidth utilisation at the same time. Extensive numerical analysis and PlanetLab experiments demonstrate that the proposed innovative NC scheme can significantly improve the delay performance for video conference like multi-party interactive multimedia applications than conventional application level multicast. Minimising delay for video conference with network coding
Hui Zhang; Jin Zhou; Jun Li
International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 38 - 58
Video conference is an attractive and promising application which allows immersive communication and discussion among people at different and distant places. However, its stringent delay and bandwidth requirements limit its scale and spread over current internet. This paper attempts to introduce the prosperous technology of network coding (NC) into video conference to minimise the maximal transmission delay between source and all the participants while retaining high bandwidth utilisation at the same time. Extensive numerical analysis and PlanetLab experiments demonstrate that the proposed innovative NC scheme can significantly improve the delay performance for video conference like multi-party interactive multimedia applications than conventional application level multicast.

]]> 10.1504/IJICOT.2011.044677 International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 38 - 58 Hui Zhang; Jin Zhou; Jun Li 3-421 FIT Building, Tsinghua Universtiy, Beijing 100084, China ' 3-419 FIT Building, Tsinghua Universtiy, Beijing 100084, China ' 4-412 FIT Building, Tsinghua Universtiy, Beijing 100084, China network coding video conferencing interactive multimedia multicast transmission delay. 2012-01-02T23:20:50-05:00 2 1 38 58 2012-01-02T23:20:50-05:00 http://www.inderscience.com/link.php?id=44678 The algebraic decoding of binary quadratic residue codes can be performed using the Peterson or the Berlekamp-Massey algorithm once certain unknown syndromes are determined. In this work, the technique of determining unknown syndromes is extended to the ternary case to decode the expurgated ternary quadratic residue code of length 37. Algebraic decoding of the ternary (37, 18, 11) quadratic residue code
J. Carmelo Interlando
International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 59 - 65
The algebraic decoding of binary quadratic residue codes can be performed using the Peterson or the Berlekamp-Massey algorithm once certain unknown syndromes are determined. In this work, the technique of determining unknown syndromes is extended to the ternary case to decode the expurgated ternary quadratic residue code of length 37.

]]> 10.1504/IJICOT.2011.044678 International Journal of Information and Coding Theory, Vol. 2, No. 1 (2011) pp. 59 - 65 J. Carmelo Interlando Department of Mathematics and Statistics, San Diego State University, 5500 Campanile Drive, GMCS 415, San Diego, CA 92182-7720, USA non-binary coding quadratic residue codes algebraic decoding. 2012-01-02T23:20:50-05:00 2 1 59 65 2012-01-02T23:20:50-05:00