Mixed binary/ternary covering codes
From MaRDI portal
Publication:4972024
zbMATH Open1425.94087MaRDI QIDQ4972024FDOQ4972024
Authors: Emil Kolev
Publication date: 22 November 2019
Full work available at URL: http://bulletin.math.uoc.gr/vol/59/59-83-90.pdf
Recommendations
Cites Work
- An updated table of binary/ternary mixed covering codes
- The football pool problem for 5 matches
- Further results on the covering radius of small codes
- Lower bounds for the football pool problem for 7 and 8 matches
- On small covering codes in arbitrary mixed hamming spaces
- Title not available (Why is that?)
- Codes over GF(3) of length 5, 27 codewords, and covering radius 1
Cited In (6)
- Ternary Hamming and binary perfect covering codes
- Title not available (Why is that?)
- Constructions for perfect mixed codes and other covering codes
- Generalized bounds and binary/ternary mixed packing and covering codes
- An updated table of binary/ternary mixed covering codes
- Title not available (Why is that?)
This page was built for publication: Mixed binary/ternary covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972024)