perfect binary codes
Recently Published Documents

TOTAL DOCUMENTS

40
(FIVE YEARS 1)

H-INDEX

7
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Perfect Binary Codes Capable of Correcting Equal Multiple Deletions

2021 ◽  
Author(s):  
Kento Nakada
Keyword(s):  
Binary Codes ◽  
Perfect Binary Codes

scholarly journals Weight spectrum of quasi-perfect binary codes with distance 4

2017 ◽  
Author(s):  
Valentin B. Afanassiev ◽  
Alexander A. Davydov
Keyword(s):  
Binary Codes ◽  
Perfect Binary Codes

Perfect binary codes of infinite length

2017 ◽  
Vol 11 (2) ◽  
pp. 227-235
Author(s):  
S. A. Malyugin
Keyword(s):  
Binary Codes ◽  
Infinite Length ◽  
Perfect Binary Codes

scholarly journals Perfect binary codes of infinite length

2015 ◽  
pp. 117-120 ◽  
Author(s):  
S. A. Malyugin ◽  
Keyword(s):  
Binary Codes ◽  
Infinite Length ◽  
Perfect Binary Codes

On separability of the classes of homogeneous and transitive perfect binary codes

2015 ◽  
Vol 51 (2) ◽  
pp. 139-147
Author(s):  
I. Yu. Mogilnykh ◽  
F. I. Solov’eva
Keyword(s):  
Binary Codes ◽  
Perfect Binary Codes

Steiner quadruple systems of small rank and extended perfect binary codes

2013 ◽  
Vol 7 (4) ◽  
pp. 522-536
Author(s):  
D. I. Kovalevskaya ◽  
F. I. Solov’eva
Keyword(s):  
Binary Codes ◽  
Small Rank ◽  
Steiner Quadruple Systems ◽  
Perfect Binary Codes

Rank spectrum of propelinear perfect binary codes

2013 ◽  
Author(s):  
George K. Guskov ◽  
Ivan Yu. Mogilnykh ◽  
Faina I. Solov'eva
Keyword(s):  
Binary Codes ◽  
Perfect Binary Codes

On the steiner triple systems of small rank embedded into perfect binary codes

2013 ◽  
Vol 7 (3) ◽  
pp. 380-395
Author(s):  
D. I. Kovalevskaya ◽  
F. I. Solov’eva ◽  
E. S. Filimonova
Keyword(s):  
Binary Codes ◽  
Steiner Triple Systems ◽  
Triple Systems ◽  
Small Rank ◽  
Perfect Binary Codes

scholarly journals On the Number of Nonequivalent Propelinear Extended Perfect Codes

10.37236/3220 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Joaquim Borges ◽  
Ivan Yu. Mogilnykh ◽  
Josep Rifà ◽  
Faina I. Solov'eva
Keyword(s):  
Binary Codes ◽  
Hamming Code ◽  
Perfect Codes ◽  
Small Rank ◽  
Perfect Binary Codes

The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the properties of these codes and show that any of them has a normalized propelinear representation.

On the Steiner quadruple systems of small rank which are embeddable into extended perfect binary codes

2013 ◽  
Vol 7 (1) ◽  
pp. 68-77 ◽  
Author(s):  
D. I. Kovalevskaya ◽  
F. I. Solov’eva
Keyword(s):  
Binary Codes ◽  
Small Rank ◽  
Steiner Quadruple Systems ◽  
Perfect Binary Codes
Load More ...
Sign in / Sign up

Export Citation Format

Share Document