Even-Length Modified Linear Block Code for Space Links

International Journal of Electronics and Communication Engineering

© 2025 by SSRG - IJECE Journal

Volume 12 Issue 9

Year of Publication : 2025

Authors : Seema Talmale, B. K. Lande

10.14445/23488549/IJECE-V12I9P116

How to Cite?

Seema Talmale, B. K. Lande, "Even-Length Modified Linear Block Code for Space Links," SSRG International Journal of Electronics and Communication Engineering, vol. 12,  no. 9, pp. 188-193, 2025. Crossref, https://doi.org/10.14445/23488549/IJECE-V12I9P116

Abstract:

This work introduces a new technique for constructing enhanced-distance linear block codes tailored for binary vector systems with even dimensions. The approach is based on the theory of completely controllable discrete-time systems, where the solution space of such systems is systematically adapted to generate the code structure. As a demonstration, a controllable system of order 20 is used to design a (40,20) block-structured linear code, corresponding to an information rate of 0.5. To strengthen the error-correcting capability, a specialized mapping method is applied, which increases the minimum separation among valid code words by permuting the binary vectors. By widening this distance, the code exhibits improved tolerance to transmission errors. Simulation studies show that the suggested design achieves a lower Bit-Error Rate (BER) and a smaller probability of undetected errors compared with other block codes having the same parameters. These attributes make the scheme highly suitable for applications requiring exceptional reliability, such as deep-space communication, where both accuracy and robustness are critical. The results highlight how integrating concepts from control theory with modern coding strategies can produce efficient error-correcting codes for demanding communication systems, and they point toward future research opportunities in control-based code design for advanced data transmission.

Keywords:

Generator matrix, Discrete-time system, Bounds, Minimum distance, Code word, BER (Bit Error Rate).

References:

[1] Joachim Rosenthal, “Connections between Linear Systems and Convolutional Codes,” Conference Proceedings: Codes, Systems, and Graphical Models, pp. 39-66, 2001.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Joachim Rosenthal, An Optimal Control Theory for Systems Defined Over Finite Rings, Open Problems in Mathematical Systems and Control Theory, 1st ed., Springer, pp. 193-201, 1999.
[CrossRef] [Google Scholar] [Publisher Link]
[3] R.E. Kalman, “On the General Theory of Control Systems,” IFAC Proceedings Volumes, vol. 1, no. 1, pp. 491-502, 1960.
[CrossRef] [Google Scholar] [Publisher Link]
[4] David A. Huffman, “A Method for the Construction of Minimum-Redundancy Codes,” Proceedings of the IRE, vol. 40, no. 9, pp. 1098-1011, 1952.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Jen-Chun Chang, “Distance-Increasing Mappings from Binary Vectors to Permutations,” IEEE Transactions on Information Theory, vol. 51, no.1, pp. 359-363, 2005.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Marzieh Akbari, Neil I. Gillespie, and Cheryl E. Praeger, “Increasing the Minimum Distance of Codes by Twisting,” The Electronic Journal of Combinatorics, vol. 25, no. 3, pp. 1-19, 2018.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Kwankyu Lee, “New Distance-Preserving Maps of Odd Length,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2539-2543, 2004.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Jyh-Shyan Lin et al., “Distance-Preserving and Distance-Increasing Mappings from Ternary Vectors to Permutations,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1334-1339, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Yeow Meng Chee, and Punarbasu Purkayastha, “Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps,” 2012 IEEE International Symposium on Information Theory Proceedings, Cambridge, MA, USA, pp. 636-640, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[10] J. Rosenthal, “Some Interesting Problems in Systems Theory which are of Fundamental Importance in Coding Theory,” Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, California, USA, pp. 4574-4579, 1997.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Xuemin Chen et al., “Use of Grobner Bases to Decode Binary Cyclic Codes up to the True Minimum Distance,” IEEE Transactions on Information Theory, vol. 40, no. 5, pp. 1654-1661, 1994.
[CrossRef] [Google Scholar] [Publisher Link]
[12] I.S. Reed, X. Yin, and T.-K. Truong, “Algebraic Decoding of the (32, 16, 8) Quadratic Residue Code,” IEEE Transactions on Information Theory, vol. 36, no. 4, pp. 876-880, 1990.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Trieu-Kien Truong et al., “Algebraic Decoding of the (89,45,17) Quadratic Residue Code,” IEEE Transactions on Information Theory, vol. 54, no. 11, pp. 5005-5011, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[14] T.-K. Truong, J.-H. Jeng, and I.S. Reed, “Fast Algorithm for Computing the Roots of Error Locator Polynomials up to Degree 11 in Reed-Solomon Decoders,” IEEE Transactions on Communications, vol. 49, no. 5, pp. 779-783, 2001.
[CrossRef] [Google Scholar] [Publisher Link]
[15] E.R. Berlekamp, H. Rumsey, and G. Solomon, “On the Solution of Algebraic Equations Over Finite Fields,” Information and Control, vol. 10, no. 6, pp. 533-564, 1967.
[CrossRef] [Google Scholar] [Publisher Link]
[16] S.V. Fedorenko, and P.V. Trifonov, “Finding Roots of Polynomials Over Finite Fields,” IEEE Transactions on Communications, vol. 50, no. 11, pp. 1709-1711, 2002.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Tsung-Ching Lin, T.K. Truong, and P.D. Chen, “A Fast Algorithm for the Syndrome Calculation in Algebraic Decoding of Reed–Solomon Codes,” IEEE Transactions on Communications, vol. 55, no. 12, pp. 2240-2244, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Chunming Rong, T. Helleseth, and J. Lahtonen, “On Algebraic Decoding of the Z/sub 4/-Linear Calderbank-McGuire Code,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1423-1434, 1999.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Georg Schmidt, Vladimir R. Sidorenko, and Martin Bossert, “Syndrome Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis,” IEEE Transactions on Information Theory, vol. 56, no. 10, pp. 5245-5252, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Tsung-Ching Lin et al., “Algebraic Decoding of the (31, 16, 7) Quadratic Residue Code by Using Berlekamp-Massey Algorithm,” 2010 International Conference on Communications and Mobile Computing, Shenzhen, China, pp. 275-277, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[21] Pengwei Zhang et al., “Fast Decoding of the (47, 24, 11) Quadratic Residue Code Without Determining the Unknown Syndromes,” IEEE Communications Letters, vol. 19, no. 8, pp. 1279-1282, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Virtudes Tomas, Joachim Rosenthal, and Roxana Smarandache, “Decoding of Convolutional Codes Over the Erasure Channel,” IEEE Transactions on Information Theory, vol. 58, no. 1, pp. 90-108, 2018.
[CrossRef] [Google Scholar] [Publisher Link]