Linear error-block codes

Authors:
Keqin Feng;Lanju Xu;Fred J. Hickernell
Affiliations:
Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China;Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China;Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong SAR, China
Venue:
Finite Fields and Their Applications
Year:
2006

Citing 4
Cited 2

Codes with a poset metric

Discrete Mathematics
Introduction to Coding Theory

Introduction to Coding Theory
Rational Points on Curves over Finite Fields: Theory and Applications

Rational Points on Curves over Finite Fields: Theory and Applications
Projective systems and perfect codes with a poset metric

Finite Fields and Their Applications

Constructions and bounds on linear error-block codes

Designs, Codes and Cryptography
Classification of Niederreiter-Rosenbloom-Tsfasman block codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration and cryptography. This article formulates the concept of a linear error-block code and derives basic results for this kind of code by direct analogy to the classical case. Some problems for further research are raised.