scholarly journals New self-dual codes from $ 2 \times 2 $ block circulant matrices, group rings and neighbours of neighbours

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Joe Gildea ◽  
Abidin Kaya ◽  
Adam Michael Roberts ◽  
Rhian Taylor ◽  
Alexander Tylyshchak
Keyword(s):  
Circulant Matrix ◽  
Circulant Matrices ◽  
Group Rings ◽  
Unique Combination ◽  
Dual Codes ◽  
Construction Of Self ◽  
New Construction

<p style='text-indent:20px;'>In this paper, we construct new self-dual codes from a construction that involves a unique combination; <inline-formula><tex-math id="M1">\begin{document}$ 2 \times 2 $\end{document}</tex-math></inline-formula> block circulant matrices, group rings and a reverse circulant matrix. There are certain conditions, specified in this paper, where this new construction yields self-dual codes. The theory is supported by the construction of self-dual codes over the rings <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{F}_2 $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M3">\begin{document}$ \mathbb{F}_2+u \mathbb{F}_2 $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_4+u \mathbb{F}_4 $\end{document}</tex-math></inline-formula>. Using extensions and neighbours of codes, we construct <inline-formula><tex-math id="M5">\begin{document}$ 32 $\end{document}</tex-math></inline-formula> new self-dual codes of length <inline-formula><tex-math id="M6">\begin{document}$ 68 $\end{document}</tex-math></inline-formula>. We construct 48 new best known singly-even self-dual codes of length 96.</p>

scholarly journals Double bordered constructions of self-dual codes from group rings over Frobenius rings

2020 ◽  
Vol 12 (4) ◽  
pp. 769-784
Author(s):  
Joe Gildea ◽  
Rhian Taylor ◽  
Abidin Kaya ◽  
A. Tylyshchak
Keyword(s):  
Group Rings ◽  
Dual Codes ◽  
Weight Enumerators ◽  
Frobenius Rings ◽  
Construction Of Self ◽  
New Construction ◽  
New Codes

AbstractIn this work, we describe a double bordered construction of self-dual codes from group rings. We show that this construction is effective for groups of order 2p where p is odd, over the rings $\mathbb {F}_{2}+u\mathbb {F}_{2}$ F 2 + u F 2 and $\mathbb {F}_{4}+u\mathbb {F}_{4}$ F 4 + u F 4 . We demonstrate the importance of this new construction by finding many new binary self-dual codes of lengths 64, 68 and 80; the new codes and their corresponding weight enumerators are listed in several tables.

The Travelling Salesman Problem in symmetric circulant matrices with two stripes

2008 ◽  
Vol 18 (1) ◽  
pp. 165-175 ◽  
Author(s):  
IVAN GERACE ◽  
FEDERICO GRECO
Keyword(s):  
Computational Complexity ◽  
Lower Bound ◽  
Lower Bounds ◽  
Travelling Salesman Problem ◽  
Minimum Cost ◽  
Circulant Matrix ◽  
Upper And Lower Bounds ◽  
Circulant Matrices ◽  
Travelling Salesman ◽  
New Construction

The Symmetric Circulant Travelling Salesman Problem asks for the minimum cost tour in a symmetric circulant matrix. The computational complexity of this problem is not known – only upper and lower bounds have been determined. This paper provides a characterisation of the two-stripe case. Instances where the minimum cost of a tour is equal to either the upper or lower bound are recognised. A new construction providing a tour is proposed for the remaining instances, and this leads to a new upper bound that is closer than the previous one.

scholarly journals Constructing self-dual codes from group rings and reverse circulant matrices

2019 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Joe Gildea ◽  
◽  
Adrian Korban ◽  
Abidin Kaya ◽  
Bahattin Yildiz ◽  
...  
Keyword(s):  
Circulant Matrices ◽  
Group Rings ◽  
Dual Codes

scholarly journals DIVERSITY AES IN MIXCOLUMNS STEP WITH 8X8 CIRCULANT MATRIX

2021 ◽  
Vol 8 (9) ◽  
pp. 19-35
Author(s):  
Yan-Wen Chen ◽  
Jeng-Jung Wang ◽  
Yan-Haw Chen ◽  
Chong-Dao Lee
Keyword(s):  
Embedded Systems ◽  
Efficient Method ◽  
Matrix Multiplication ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Matrix Operation ◽  
Branch Number ◽  
Involutory Matrix ◽  
Software Implementations ◽  
Encryption Decryption

In AES MixColumns operation, the branch number of circulant matrix is raised from 5 to 9 with 8´8 circulant matrices that can be enhancing the diffusion power. An efficient method to compute the circulant matrices in AES MixColumns transformation for speeding encryption is presented. Utilizing 8´8 involutory matrix multiplication is required 64 multiplications and 56 additions in in AES Mix-Columns transformation. We proposed the method with diversity 8´8 circulant matrices is only needed 19 multiplications and 57 additions. It is not only to encryption operations but also to decryption operations. Therefore, 8´8 circlant matrix operation with AES key sizes of 128bits, 192bits, and 256 bits are above 29.1%, 29.3%, and 29.8% faster than using 4´4 involutory matrix operation (16 multiplications, 12 additions), respectively. 8´8 circulant matrix encryption/decryption speed is above 78% faster than 8´8 involutory matrix operation. Ultimately, the proposed method for evaluating matrix multiplication can be made regular, simple and suitable for software implementations on embedded systems.

scholarly journals Constructions for self-dual codes induced from group rings

2018 ◽  
Vol 51 ◽  
pp. 71-92 ◽  
Author(s):  
Joe Gildea ◽  
Abidin Kaya ◽  
Rhian Taylor ◽  
Bahattin Yildiz
Keyword(s):  
Group Rings ◽  
Dual Codes

scholarly journals Accelerating Deep Neural Networks by Combining Block-Circulant Matrices and Low-Precision Weights

Electronics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 78 ◽  
Author(s):  
Zidi Qin ◽  
Di Zhu ◽  
Xingwei Zhu ◽  
Xuan Chen ◽  
Yinghuan Shi ◽  
...  
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Matrix Vector Multiplication ◽  
Processing Power ◽  
Measurement Results ◽  
Block Circulant Matrix ◽  
Storage Complexity ◽  
Fully Connected

As a key ingredient of deep neural networks (DNNs), fully-connected (FC) layers are widely used in various artificial intelligence applications. However, there are many parameters in FC layers, so the efficient process of FC layers is restricted by memory bandwidth. In this paper, we propose a compression approach combining block-circulant matrix-based weight representation and power-of-two quantization. Applying block-circulant matrices in FC layers can reduce the storage complexity from O ( k 2 ) to O ( k ) . By quantizing the weights into integer powers of two, the multiplications in the reference can be replaced by shift and add operations. The memory usages of models for MNIST, CIFAR-10 and ImageNet can be compressed by 171 × , 2731 × and 128 × with minimal accuracy loss, respectively. A configurable parallel hardware architecture is then proposed for processing the compressed FC layers efficiently. Without multipliers, a block matrix-vector multiplication module (B-MV) is used as the computing kernel. The architecture is flexible to support FC layers of various compression ratios with small footprint. Simultaneously, the memory access can be significantly reduced by using the configurable architecture. Measurement results show that the accelerator has a processing power of 409.6 GOPS, and achieves 5.3 TOPS/W energy efficiency at 800 MHz.

scholarly journals On the Spectrum and Spectral Norms of r-Circulant Matrices with Generalized k-Horadam Numbers Entries

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Lele Liu
Keyword(s):  
Explicit Formula ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Sufficient Condition ◽  
Abel Transformation

This work is concerned with the spectrum and spectral norms of r-circulant matrices with generalized k-Horadam numbers entries. By using Abel transformation and some identities we obtain an explicit formula for the eigenvalues of them. In addition, a sufficient condition for an r-circulant matrix to be normal is presented. Based on the results we obtain the precise value for spectral norms of normal r-circulant matrix with generalized k-Horadam numbers, which generalize and improve the known results.

scholarly journals The Determinants, Inverses, Norm, and Spread of Skew Circulant Type Matrices Involving Any Continuous Lucas Numbers

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jin-jiang Yao ◽  
Zhao-lin Jiang
Keyword(s):  
Circulant Matrix ◽  
Circulant Matrices ◽  
Lucas Numbers ◽  
Transformation Matrices ◽  
Skew Circulant ◽  
The Relationship

We consider the skew circulant and skew left circulant matrices with any continuous Lucas numbers. Firstly, we discuss the invertibility of the skew circulant matrices and present the determinant and the inverse matrices by constructing the transformation matrices. Furthermore, the invertibility of the skew left circulant matrices is also discussed. We obtain the determinants and the inverse matrices of the skew left circulant matrices by utilizing the relationship between skew left circulant matrices and skew circulant matrix, respectively. Finally, the four kinds of norms and bounds for the spread of these matrices are given, respectively.

Sign in / Sign up

Export Citation Format

Share Document