Results 131 to 140 of about 563,145 (166)

NONBINARY QUANTUM CODES DERIVED FROM GROUP CHARACTER CODES

International Journal of Quantum Information, 2012
Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite
Qian, Jianfa, Zhang, Lina
openaire   +2 more sources

Braid groups in genetic code

Algebra and Logic, 2006
Summary: For every genetic code with finitely many generators and at most one relation, a braid group is introduced. The construction presented includes the braid group of the plane, braid groups of closed oriented surfaces, Artin-Brieskorn braid groups of series \(B\), and allows us to study all of these groups from a unified standpoint.
openaire   +1 more source

Minimal syndrome formers for group codes

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 1999
Summary: Given a controllable group code, it has been shown by Forney, Trott, and Loeliger that it is possible to construct a canonical encoder whose state space coincides with the canonical state space of the code, that is the essential element determining the minimal trellis of the code.
F. Fagnani, ZAMPIERI, SANDRO
openaire   +3 more sources

Codes from Affine Permutation Groups

Designs, Codes and Cryptography, 1998
The maximum cardinality of a (linear or nonlinear) binary code of length \(n\) and minimum Hamming distance \(d\) is denoted by \(A(n,d)\). The author constructs codes that lead to improved lower bounds on \(A(n,d)\). The codes are found by stochastic computer search.
openaire   +1 more source

Group codes over crystallographic point groups

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanyan Gao, Xiaomeng Zhu
openaire   +2 more sources

Group Codes On Deligne-Lusztig Varieties

Proceedings. 1991 IEEE International Symposium on Information Theory, 2005
We construct algebraic geometric error-correcting codes using the Deligne-Lusztig varieties [1] associated to a connected reductive algebraic group G defined over a finite field Fq, with Frobenius map f. The codes are obtained as geometric Goppa codes [2], that is linear error-correcting codes constructed from algebraic varieties.
openaire   +2 more sources

Sexual health among adolescent and young adult cancer survivors: A scoping review from the Children's Oncology Group Adolescent and Young Adult Oncology Discipline Committee

Ca-A Cancer Journal for Clinicians, 2021
Brooke Cherven, Sharon L Bober, Kristin M Bingen   +2 more
exaly  

Semisimple group codes and dihedral codes

2019
We consider codes that are given as two-sided ideals in a semisimple finite group algebra FqG defined by idempotents constructed from subgroups of G in a natural way and compute their dimensions and weights. We give a criterion to decide when these ideals are all the minimal two-sided ideals o f FqG in the case when G is a dihedral group and extend ...
Dutra, F.S., Ferraz, R.A., Milies, C.P.
openaire   +1 more source

Cancer statistics for African American/Black People 2022

Ca-A Cancer Journal for Clinicians, 2022
Angela Giaquinto, Kimberly D Miller, Rebecca L Siegel   +2 more
exaly  

Cancer statistics for the US Hispanic/Latino population, 2021

Ca-A Cancer Journal for Clinicians, 2021
Kimberly D Miller, Paulo S Pinheiro, Priti Bandi   +2 more
exaly