A Novel Approach to Constructing Certain Classes of Quasi-Cyclic Codes
American Journal of Information Science and TechnologyThis paper investigates a construction algorithm for two specific families of quasi-cyclic codes defined over a finite commutative chain ring. First, by employing the Generalized Discrete Fourier Transform, we develop an efficient and systematic ...
Akram Saleh, Mohammad Soleymani
semanticscholar +1 more source
Sharing is leaking: blocking transient-execution attacks with core-gapped confidential VMs
International Conference on Architectural Support for Programming Languages and Operating SystemsConfidential VMs on platforms such as Intel TDX, AMD SEV and Arm CCA promise greater security for cloud users against even a hypervisor-level attacker, but this promise has been shattered by repeated transient-execution vulnerabilities and CPU bugs.
Charly Castes, Andrew Baumann
semanticscholar +1 more source
ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
Asian-European Journal of Mathematics, 2013For any odd prime p, a classification of all constacyclic codes of length 4ps over đť”˝pm is obtained, which establishes the algebraic structure in term of specified polynomial generators of such codes. Among other results, all self-dual and LCD cyclic and negacylic codes of length 4ps are obtained. As an example, all constacyclic codes of length 36 over
openaire +2 more sources
Quantum Constacyclic BCH Codes over Qudits: A Spectral-Domain Approach
arXiv.orgWe characterize constacyclic codes in the spectral domain using the finite field Fourier transform (FFFT) and propose a reduced complexity method for the spectral-domain decoder. Further, we also consider repeated-root constacyclic codes and characterize
Shikha Patel, S. Garani
semanticscholar +1 more source
Repeated-root constacyclic codes of length 2ps over F p
Cryptography and Communications, 2020Wateekorn Sriwirach, C. Klin-eam
semanticscholar +1 more source
Repeated Root Cyclic and Negacyclic Codes over Galois Rings
2009In this notice we describe the ideal structure of all cases of cyclic and negacyclic codes of length p s over a Galois ring alphabet that have not yet been discussed in the literature. Unlike in the cases reported earlier in the literature by various authors, the ambient spaces here are never chain rings.
Sergio R. LĂłpez-Permouth, Steve Szabo
openaire +1 more source
Repeated-root constacyclic codes of length â„“ t p s and their dual codes
Cryptography and Communications, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Structure of repeated-root constacyclic codes of length 8â„“mpn
Asian-European Journal of Mathematics, 2019Constacyclic codes form an important class of linear codes which is remarkable generalization of cyclic and negacyclic codes. In this paper, we assume that [Formula: see text] is the finite field of order [Formula: see text] where [Formula: see text] is a power of the prime [Formula: see text] and [Formula: see text] are distinct odd primes, and ...
openaire +2 more sources
Asymmetric quantum codes with high code rates
Quantum Information Processing, 2022Xilin Tang, Weixian Waylon Li, Wei Zhao
semanticscholar +1 more source
Construction of repeated-root constacyclic code of length 8 ps over $F_{p^m } $
Wuhan University Journal of Natural Sciences, 2015Xiaoyan Zhang, Qili Mao
semanticscholar +1 more source

