The zero-guards algorithm for general minimum-distance decoding problems

被引：3

作者：

Han, YSS ^{[1
]}

Hartmann, CRP ^{[1
]}

机构：

[1] SYRACUSE UNIV,DEPT ELECT ENGN & COMP SCI,SYRACUSE,NY 13244

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 05期

关键词：

decoding; linear block codes; minimum-distance decoding;

D O I：

10.1109/18.623169

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this correspondence we present some properties of an improved version of the Zero-Neighbors algorithm-the Zero-Guards algorithm. These properties can be used to find a Zero-Guards. A new decoding procedure using a Zero-Guards is also given.

引用

页码：1655 / 1658

页数：4

共 33 条

[31] Multi-Objective Bee Swarm Optimization Algorithm with Minimum Manhattan Distance for Passive Power Filter Optimization Problems
Yang, Nien-Che
Mehmood, Danish
MATHEMATICS, 2022, 10 (01)
[32] Multi-Objective Artificial Bee Colony Algorithm with Minimum Manhattan Distance for Passive Power Filter Optimization Problems
Yang, Nien-Che
Mehmood, Danish
Lai, Kai-You
MATHEMATICS, 2021, 9 (24)
[33] A modified firefly algorithm for general inverse p-median location problems under different distance norms
Alizadeh B.
Bakhteh S.
OPSEARCH, 2017, 54 (3) : 618 - 636

← 1 2 3 4 →