2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.IT2022
Neighborhoods of binary self-dual codes
Carolin Hannusch, S. Roland Major
In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length.…
cs.IT2021
The search of Type I codes
Carolin Hannusch, Roland S. Major
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by The purpose of this paper is to investigat…
cs.DS2011★ 2 cited
Modular exponentiation of matrices on FPGA-s
T. Herendi, R. Major
We describe an efficient FPGA implementation for the exponentiation of large matrices. The research is related to an algorithm for constructing uniformly distributed linear recurri…