Designing of Variable Distance Linear Block Codes with High Code Rate

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.

Authors

Publication Details

Journal
International Journal of Engineering Trends and Technology
Published
2026-11-10
DOI
https://doi.org/10.14445/22315381/ijett-v74i10p120
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Designing of Variable Distance Linear Block Codes with High Code Rate

Seema Talmale, Gayathri Pillai
International Journal of Engineering Trends and Technology
Coding theory and cryptography
article

Designing of Variable Distance Linear Block Codes with High Code Rate

Seema Talmale, Gayathri Pillai
article en

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.

International Journal of Engineering Trends and TechnologyVol. 74(10)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon