Designing of Increased Distance Modified Linear Block Code with its Decoding Algorithm using Syndrome Polynomial

Introduction: This article gives the designing of increased distance modified linear block code (MLBC). Designing of this MLBC is initially obtained from the basis vectors an Upper Triangular Matrix (UTM). Considered UTM is of 9th order. Using the basis vectors of a 9th order UTM, MLBC is established which has less minimum distance (dmin) between the codewords. A new approach is developed to increase this dmin with the help of distance increasing mapping (DIM). The developed code here for 9th order UTM is (18, 9, dmin = 5) code. A decoding algorithm is designed to decode the errors in the transmission with the help of syndrome polynomials. The developed algorithm avoids the limitation of multiple solutions and Maximum Likelihood decoding associated with Linear Block Codes. Performance of this code has been established through simulation. Examples are explored here to decode the various bit positional errors if occurred during the transmission process with the help of developed decoding algorithm through simulation. These designed codes can be used in high-frequency radio environments for transmission and reception of signals.

Authors

Publication Details

Journal
Journal of Information Systems Engineering & Management
Published
2025-03-28
DOI
https://doi.org/10.52783/jisem.v10i26s.4220
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
article

Designing of Increased Distance Modified Linear Block Code with its Decoding Algorithm using Syndrome Polynomial

Seema Talmale
Journal of Information Systems Engineering & Management
Coding theory and cryptography
article

Designing of Increased Distance Modified Linear Block Code with its Decoding Algorithm using Syndrome Polynomial

Seema Talmale
article en

Abstract

Introduction: This article gives the designing of increased distance modified linear block code (MLBC). Designing of this MLBC is initially obtained from the basis vectors an Upper Triangular Matrix (UTM). Considered UTM is of 9th order. Using the basis vectors of a 9th order UTM, MLBC is established which has less minimum distance (dmin) between the codewords. A new approach is developed to increase this dmin with the help of distance increasing mapping (DIM). The developed code here for 9th order UTM is (18, 9, dmin = 5) code. A decoding algorithm is designed to decode the errors in the transmission with the help of syndrome polynomials. The developed algorithm avoids the limitation of multiple solutions and Maximum Likelihood decoding associated with Linear Block Codes. Performance of this code has been established through simulation. Examples are explored here to decode the various bit positional errors if occurred during the transmission process with the help of developed decoding algorithm through simulation. These designed codes can be used in high-frequency radio environments for transmission and reception of signals.

Journal of Information Systems Engineering & ManagementVol. 10(26s)
Openalex Percentile: Top 97%
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.

Designing of Increased Distance Modified Linear Block Code with its Decoding Algorithm using Syndrome Polynomial — Seema Talmale · Journal of Information Systems Engineering & Management (2025) | TGRS Research Map | TGRS