𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions

✍ Scribed by Hai Q. Dinh

Book ID
108131460
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
206 KB
Volume
14
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the covering radius of cyclic linear
On the covering radius of cyclic linear codes and arithmetic codes
✍ Tor Helleseth πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC

On computing the minimum distance of lin
On computing the minimum distance of linear codes
✍ Masami Mohri; Masakatu Morii πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

On a class of partially ordered sets and
On a class of partially ordered sets and their linear invariants
✍ Johannes Siemons πŸ“‚ Article πŸ“… 1992 πŸ› Springer 🌐 English βš– 497 KB

Let (Z~a, <) be a finite partially ordered set with rank function. Then ff is the disjoint union of the classes ~k of elements of rank k and the order relation between elements in ~k and ~ak+ 1 can be represented by a matrix S k. We study partially ordered sets which satisfy linear recurrence relati