𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing Covering Codes with Given Automorphisms

✍ Scribed by Patric R. J. Osterg; William D. Weakley

Book ID
110262145
Publisher
Springer
Year
1999
Tongue
English
Weight
66 KB
Volume
16
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructing covering codes by tabu sear
Constructing covering codes by tabu search
✍ Patric R. J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

The problem of finding good covering codes in Hamming spaces is considered. Many different local search methods have been used to find packing codes (the dual problem), whereas practically all published results on searches for covering codes are based on simulated annealing. In this article tabu sea

Codes with given distances
Codes with given distances
✍ H. Enomoto; P. Frankl; N. Ito; K. Nomura πŸ“‚ Article πŸ“… 1987 πŸ› Springer Japan 🌐 English βš– 784 KB
Vector representable matroids of given r
Vector representable matroids of given rank with given automorphism group
✍ LΓ‘szlΓ³ Babai πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 471 KB

A simple way of as,;ociating a matroid of prescribed rank with a graph is shown. The matroids so corhstrueted are re.presentable over any sufficiently large field. Their ase is demonstrated by the fallowing result: Given an integer k >~ 3 and a hmction G associating a group with each subsel of a set