Citation :

Seema Talmale, Gayathri Pillai, "Designing of Variable Distance Linear Block Codes with High Code Rate," International Journal of Engineering Trends and Technology (IJETT), vol. 74, no. 10, pp. 280-287, 2026. Crossref, https://doi.org/10.14445/22315381/IJETT-V74I10P120

Abstract

Developing long codes with high levels of error correction capability has been one of the most difficult issues in coding theory. This research introduces an alternative way to create a new type of Increased Distance Linear Block Code (IDLBC). This code has a code rate greater than 1/2. The IDLBC starts with the creation of a generator matrix by using an Upper Triangular Matrix (UTM) and constructing one Linear Block Code (LBC) that has Distance-Preserving Mapping (DPM) property for any (n, k) combinations. Afterwards, an algorithm is used to change the UTM of the generator matrix to give a code with a Distance-Increasing Mapping (DIM) property. The performance of the code is then enhanced using code puncturing to produce a code having a code rate of more than 1/2, but maintaining the improved performance for Bit Error Rate (BER). It is clear that the codes being developed in this paper are superior to the traditional Hamming Codes. The transition from DPM to DIM gives codes with improved distance performance, leading to more reliable performance.

Keywords

Code rate, Bit Error Rate, Generator matrix, Parity check matrix, Block code, Decoding, Puncturing.

References

1. A.J. Han Vinck, J. Haering, and Tadashi Wadayama, “Coded M-FSK for Power Line Communications,” 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, 2000.
   [CrossRef] [Google Scholar] [Publisher Link]
2. Theo G. Swart, and Hendrik C. Ferreira, “Decoding Distance-Preserving Permutation Codes for Power-Line Communications,” AFRICON 2007, Windhoek, South Africa, pp. 1-7, 2007.
   [CrossRef] [Google Scholar] [Publisher Link]
3. Xiaoqian Xie et al., “Low Complexity Majority-Logic Decoding for LDPC-Coded PNC Systems,” IEEE Communications Letters, vol. 26, no. 5, pp. 959-963, 2022.
   [CrossRef] [Google Scholar] [Publisher Link]
4. Jafar A. Alzubi, Omar A. Alzubi, and Thomas M. Chen, Forward Error Correction based on Algebraic-Geometric Theory, 1^st ed., Springer Cham, 2014.
   [CrossRef] [Google Scholar] [Publisher Link]
5. 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]
6. Jen-Chun Chang et al., “Distance-Preserving Mappings from Binary Vectors to Permutations,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 1054-1059, 2003.
   [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. 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]
9. H.C. Ferreira, and A.J. Han Vinck, “Interference Cancellation with Permutation Trellis Codes,” Vehicular Technology Conference Fall 2000, IEEE VTS Fall VTC2000, 52^nd Vehicular Technology Conference (Cat. No.00CH37152), Boston, MA, USA, vol. 5, pp. 2401-2407, 2000.
   [CrossRef] [Google Scholar] [Publisher Link]
10. 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]
11. Tsung-Ching Lin, Trieu-Kien 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]
12. Chunming Rong, Tor Helleseth, and Jyrki 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]
13. 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]
14. 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]
15. 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]
16. 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, 2012.
    [CrossRef] [Google Scholar] [Publisher Link]
17. Sheng Jin et al., “Circular-Shift-based Vector Linear Network Coding and its Application to Array Codes,” IEEE Transactions on Information Theory, vol. 71, no. 12, pp. 9413-9431, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]
18. Hanqi Tang et al., “The Multicast Solvability of Permutation Linear Network Coding,” IEEE Communications Letters, vol. 27, no. 1, pp. 105-109, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]
19. Leilei Yu et al., “Variant Codes based on a Special Polynomial Ring and their Fast Computations,” IEEE Transactions on Communications, vol. 72, no. 9, pp. 5255-5267, 2024.
    [CrossRef] [Google Scholar] [Publisher Link]