[图书][B] Classification algorithms for codes and designs
P Kaski, PRJ Östergård - 2006 - Springer
Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
MOLGEN 5.0, a molecular structure generator
R Gugisch, A Kerber, A Kohnert, R Laue… - Advances in …, 2015 - Elsevier
MOLGEN 5. x combines the efficiency of the molecular generator MOLGEN 3.5 and the
flexibility of MOLGEN 4. x. To achieve this, the software was reimplemented based on a …
flexibility of MOLGEN 4. x. To achieve this, the software was reimplemented based on a …
Computer classification of linear codes
I Bouyukliev, S Bouyuklieva… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Computer Classification of Linear Codes Page 1 IEEE TRANSACTIONS ON INFORMATION
THEORY, VOL. 67, NO. 12, DECEMBER 2021 7807 Computer Classification of Linear Codes …
THEORY, VOL. 67, NO. 12, DECEMBER 2021 7807 Computer Classification of Linear Codes …
Computer classification of linear codes based on lattice point enumeration
S Kurz - International Congress on Mathematical Software, 2024 - Springer
Linear codes related to applications in Galois Geometry often require a certain divisibility of
the occurring weights. In this paper we present an algorithmic framework for the …
the occurring weights. In this paper we present an algorithmic framework for the …
Towards the classification of self-dual bent functions in eight variables
T Feulner, L Sok, P Solé, A Wassermann - Designs, codes and …, 2013 - Springer
In this paper, we classify quadratic and cubic self-dual bent functions in eight variables with
the help of computers. There are exactly four and 45 non-equivalent self-dual bent functions …
the help of computers. There are exactly four and 45 non-equivalent self-dual bent functions …
On the consistent path problem
The application of decision diagrams in combinatorial optimization has proliferated in the
last decade. In recent years, authors have begun to investigate how to use not one, but a set …
last decade. In recent years, authors have begun to investigate how to use not one, but a set …
Optimal linear codes from matrix groups
M Braun, A Kohnert… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
New linear codes (sometimes optimal) over the finite field with q elements are constructed.
In order to do this, an equivalence between the existence of a linear code with a prescribed …
In order to do this, an equivalence between the existence of a linear code with a prescribed …
Computational methods in subspace designs
M Braun, M Kiermaier, A Wassermann - Network Coding and Subspace …, 2018 - Springer
Subspace designs are the q-analogs of combinatorial designs. Introduced in the 1970s,
these structures gained a lot of interest recently because of their application to random …
these structures gained a lot of interest recently because of their application to random …
The integral basis method for integer programming
This paper introduces an exact algorithm for solving integer programs, neither using cutting
planes nor enumeration techniques. It is a primal augmentation algorithm that relies on …
planes nor enumeration techniques. It is a primal augmentation algorithm that relies on …