scientific article; zbMATH DE number 1284415
From MaRDI portal
Publication:4242009
zbMath0924.94037MaRDI QIDQ4242009
Publication date: 14 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (17)
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ Hyper-bent functions and cyclic codes ⋮ Computing the edit distance of a regular language ⋮ Quasi-Self-Dual Codes over a Non-Unital Ring of Order 4 ⋮ Constructing permutation arrays from groups ⋮ Antiblocking systems and PD-sets ⋮ Determination of weight enumerators of binary extremal self-dual \([42,21,8\) codes] ⋮ Linear transformations on codes ⋮ Energy bounds for codes in polynomial metric spaces ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ PD-sets for the codes related to some classical varieties ⋮ Lights Out on graphs ⋮ On the size of partial block designs with large blocks ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless ⋮ Quadratic double circulant codes over fields ⋮ New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane ⋮ Optimal tristance anticodes in certain graphs
This page was built for publication:
