Results 221 to 230 of about 10,192,265 (264)
Mitogenomic and phylogenomic analyses identify a cohesive Western Atlantic lineage within the Narcine complex (Torpediniformes: Narcinidae). [PDF]
Mol Biol RepPalacios-Barreto P +8 more
europepmc +1 more source
The MacWilliams Identity for the m-Spotty Weight Enumerators over ZpRk. [PDF]
Entropy (Basel)Wang J, Jiang A, Solé P.
europepmc +1 more source
Genomic and functional characterization of ST11-KL64 hypervirulence-associated carbapenem-resistant <i>Klebsiella pneumoniae</i> co-harboring <i>bla</i> <sub>KPC-2</sub> and <i>bla</i> <sub>NDM-13</sub>. [PDF]
Front MicrobiolChen H +6 more
europepmc +1 more source
Algebraic Coding Theory Over Finite Commutative Rings
SpringerBriefs in Mathematics, 2017 This book provides a self-contained introduction to algebraic coding theory over finite Frobenius rings. It is the first to offer a comprehensive account on the subject.
Steven Dougherty
exaly +2 more sources
On achievability of linear source coding over finite rings
, 2013 We propose using linear mappings over finite rings as encoders in the Slepian-Wolf and the source coding for computing problems. It is known that the arithmetic of many finite rings is substantially easier to implement than the one of finite fields ...
Mikael Skoglund
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 2003
Summary: Shannon suggested investigating a binary multiplying channel and asked for a maximal uniquely decodable symmetric code. Motivated by his example, we define such a code, called a Shannon set, for an arbitrary ring. We investigate the Shannon sets for the rings \(\mathbb F_q^{n\times n}\) for \(n\in\mathbb N\) and the rings \(\mathbb Z_m=\mathbb
André Barbé, Fritz von Haeseler
openaire +3 more sources
Summary: Shannon suggested investigating a binary multiplying channel and asked for a maximal uniquely decodable symmetric code. Motivated by his example, we define such a code, called a Shannon set, for an arbitrary ring. We investigate the Shannon sets for the rings \(\mathbb F_q^{n\times n}\) for \(n\in\mathbb N\) and the rings \(\mathbb Z_m=\mathbb
André Barbé, Fritz von Haeseler
openaire +3 more sources
Designs, Codes and Cryptography, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven T. Dougherty, Esengül Saltürk
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven T. Dougherty, Esengül Saltürk
openaire +1 more source
On cyclic codes over Galois rings
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jasbir Kaur, Sucheta Dutt, Ranjeet Sehmi
openaire +3 more sources
On the Equivalence of Codes over Finite Rings
Applicable Algebra in Engineering, Communication and Computing, 2004Let \(R\) be a finite (not necessarily commutative) ring with identity. The authors call \(R\) a `left (right) MacWilliams ring' if for each \(n\geq 1\) and linear code \(C \subseteq R^n\), every left (right) isometry \(C\rightarrow R^n\) extends to a monomial transformation of \(R^n\).
Hai Quang Dinh 0001 +1 more
openaire +2 more sources