13 citations · 19 across the 6 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2018
A note on reducing the computation time for minimum distance and equivalence check of binary linear codes
Nikolay Yankov, Krassimir Enev
In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computatio…
cs.IT2014★ 3 cited
On the Automorphisms of Order 15 for a Binary Self-Dual [96, 48, 20] Code
Stefka Bouyuklieva, Wolfgang Willems, Nikolay Yankov
The structure of binary self-dual codes invariant under the action of a cyclic group of order for odd primes is considered. As an application we prove the nonexisten…
cs.IT2012★ 1 cited
Classification of Binary Self-Dual [48,24,10] Codes with an Automorphism of Odd Prime Order
Stefka Bouyuklieva, Nikolay Yankov, Jon-Lark Kim
The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48,…