Two classes of minimum generalized distance decoding algorithms

zbMATH Open0614.94006MaRDI QIDQ1820752FDOQ1820752

Authors: S. I. Kovalev 

Publication date: 1986

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2077078
• Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
• A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
• scientific article; zbMATH DE number 4112538
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes

zbMATH Keywords

Forney algorithmgeneralized distance metric

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (5)

• A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
• Title not available (Why is that?)
• Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Generalized minimum-distance decoding of Euclidean-space codes and lattices

This page was built for publication: Two classes of minimum generalized distance decoding algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820752)