Results 41 to 50 of about 236,875 (314)

Linear transformations on codes

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David G. Glynn, T. Aaron Gulliver, Manish K. Gupta 0004   +2 more
openaire   +2 more sources

Code multiplexing using linear block codes [PDF]

EPJ Web of Conferences
This paper explores the application of code multiplexing using linear block codes in communication systems. Through a comprehensive analysis of contemporary literature on switching methods and signal modeling, the study investigates the principles of ...
Rabin Alexey, Rabin Sergei, Zyulkov Arseniy   +2 more
doaj   +1 more source

Additive Codes From Linear Codes

IEEE Transactions on Information Theory
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good.
Simeon Ball, Tabriz Popatia
openaire   +2 more sources

On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]

, 2005
Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core   +1 more source

Linear Batch Codes

, 2015
In an application, where a client wants to obtain many elements from a large database, it is often desirable to have some load balancing. Batch codes (introduced by Ishai et al. in STOC 2004) make it possible to do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every ...
Helger Lipmaa, Vitaly Skachek
openaire   +2 more sources

Linear codes from simplicial complexes

, 2018
In this article we introduce a method of constructing binary linear codes and computing their weights by means of Boolean functions arising from mathematical objects called simplicial complexes.
장승환
core   +1 more source

Low-complexity trellis decoding of linear block codes. [PDF]

, 1995
The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S., Darnell, M., Honary, B.   +2 more
core  

Stabilizer Codes and Quantum Error Correction [PDF]

, 1997
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states.
Daniel Gottesman, Gottesman, Daniel Eric
core   +1 more source

Hospitalization Through Families’ Eyes: Comparing Inpatient Care Quality for Children With Sickle Cell Disease and Cystic Fibrosis in Canada

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Sickle cell disease (SCD) is a chronic, inherited hemoglobinopathy that requires frequent hospitalization for disease‐related complications. Canadian data on inpatient care is limited. This study compared caregiver‐reported hospital experiences of children with SCD to those with cystic fibrosis (CF), a chronic, autosomal recessive ...
Hailey M. Zwicker, Kyle Kemp, Perri Tutelman, Sharon H. J. Hou, Paul Fairie, Maria Santana, Gregory M. T. Guilcher, Taryn Fay‐McClymont, Glenda Bendiak, Wendy Pelletier, Nicola Wright, Fiona Schulte   +11 more
wiley   +1 more source

Non-Projective Two-Weight Codes

Entropy
It has been known since the 1970’s that the difference of the non-zero weights of a projective Fq-linear two-weight code has to be a power of the characteristic of the underlying field.
Sascha Kurz
doaj   +1 more source