Results 231 to 240 of about 178,102 (268)
Some of the next articles are maybe not open access.

Extended maximal self-orthogonal codes

Discrete Mathematics, Algorithms and Applications, 2019
Self-dual and maximal self-orthogonal codes over [Formula: see text], where [Formula: see text] is even or [Formula: see text](mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code.
openaire   +1 more source

On self-orthogonal group ring codes

Designs, Codes and Cryptography, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fu, Wenqing, Feng, Tao
openaire   +2 more sources

Quantum codes from nearly self-orthogonal quaternary linear codes

Designs, Codes and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lisoněk, Petr, Singh, Vijaykumar
openaire   +1 more source

On optimal self-orthogonal quasi-cyclic codes

IEEE International Conference on Communications, Including Supercomm Technical Sessions, 1990
Some infinite classes of optimal self-orthogonal quasi-cycle (SOQC) equal/unequal error protection codes are presented. These codes are specified by corresponding block designs. Several optimal SOQC codes which were not found by Townsend and Weldon (1967) are also given. From the point of view of implementation, the systematic form of the code has some
Zhi Chen, null Fan Pingzhi, null Jin Fan
openaire   +1 more source

Rank codes using weak self-orthogonal bases

2010 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering (SIBIRCON), 2010
Finding a syndrome is the significant part of decoding rank codes procedure. Using a weak self-orthogonal basis one can decrease its complexity. In this case the major part of complexity evaluation is approximated by N(log N)2. It is less than the complexity when using Karatsuba-Ofman algorithm only.
Igor Y. Sysoev, Ernst M. Gabidulin
openaire   +1 more source

Weighing matrices and self-orthogonal quaternary codes

2003
A weighing matrix is a square matrix with entries \(0\), \(1\), and \(-1\), where distinct rows are orthogonal and each row and column has \(k\) non-zero entries. Viewing \(0,1\) and \(-1\) as elements of \(Z_4\) the authors use the matrices to generate self-orthogonal quaternary codes.
Charnes, C., Seberry, Jennifer
openaire   +1 more source

LCD codes and almost optimally extendable codes from self-orthogonal codes

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xinran Wang   +3 more
openaire   +2 more sources

Constructions of Self-Orthogonal Codes and LCD Codes Over Finite Fields

2024 17th International Conference on Information Security and Cryptology (ISCTürkiye)
Self-orthogonal codes, which are contained within their dual codes, have applications in linear complementary dual codes, quantum codes, etc. In this paper, we generalize the construction method given by Heng et al. in [Des. Codes Cryptogr. 91(12), 2023] to weakly regular plateaued functions. We first construct several families of p-ary self-orthogonal
Çakmak, Melike   +2 more
openaire   +2 more sources

Mass Spectrometry-Based Techniques to Elucidate the Sugar Code

Chemical Reviews, 2022
Márkó Grabarics   +2 more
exaly  

An expanded lexicon for the ubiquitin code

Nature Reviews Molecular Cell Biology, 2022
Ivan Đikić, Brenda A Schulman
exaly  

Home - About - Disclaimer - Privacy