Reduced Complexity SISO Decoding Algorithm for the First-Order Reed-Muller Codes

Novel reduced complexity soft-input soft-output decoding algorithms for first-order Reed-Muller codes are proposed. They are based on modified fast Hadamard transform and have lower decoding complexity compared to the recursive approaches.

Authors

Peter Trifonov (ORCID: https://orcid.org/0000-0001-6960-0942)
Liudmila Karakchieva (ORCID: https://orcid.org/0000-0002-0370-3444)

Institutions

ITMO University (RU)

Publication Details

Published: 2024-11-24
DOI: https://doi.org/10.1109/itw61385.2024.10806942
Primary Topic: Coding theory and cryptography
Type: article
Field-Weighted Citation Impact: 0.00

Funders

Russian Science Foundation

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Reduced Complexity SISO Decoding Algorithm for the First-Order Reed-Muller Codes

Peter Trifonov, Liudmila Karakchieva

Nov 24, 2024

Coding theory and cryptography

article

Reduced Complexity SISO Decoding Algorithm for the First-Order Reed-Muller Codes

Peter Trifonov, Liudmila Karakchieva

November 24, 2024article en

Abstract

ITMO University (RU)

Russian Science Foundation

Openalex Percentile: Top 78%

Coding theory and cryptography

DOI Source OpenAlex

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.

Reduced Complexity SISO Decoding Algorithm for the First-Order Reed-Muller Codes — Peter Trifonov, Liudmila Karakchieva · (2024) | TGRS Research Map | TGRS