Results 21 to 30 of about 105,712 (106)

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

, 2009
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is impossible even
K. Iwama, M. Hayashi, M. Hayashi, M.A. Nielsen, N. Harvey, R. Ahlswede, R. Dougherty, R. Dougherty, S. Jaggi, S.-Y.R. Li   +9 more
core   +2 more sources

A Class of Local Non-Chain Rings of Order p^5m

Axioms
This study investigates finite commutative local non-chain rings characterized by the well-established invariants p, n, m, l, and k, where p denotes a prime number. We specifically focus on Frobenius local rings with length l=5 and an index of nilpotency
Alhanouf Ali Alhomaidhi, Badriyah Rashed Alshahrani, Sami Alabiad   +2 more
doaj   +1 more source

On Multiplicative Matrix Channels over Finite Chain Rings

, 2013
Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A X$, where $X$ and $Y$ are the input and output matrices, respectively ...
Feng, Chen, Nóbrega, Roberto W., Silva, Danilo, Uchôa-Filho, Bartolomeu F.   +3 more
core   +1 more source

Terahertz Metalens for Multifocusing Bidirectional Arrangement in Different Dimensions

IEEE Photonics Journal, 2019
Metasurface lenses are typically investigated for a lot of characteristics, but the design method for conventional devices is comparatively simple in terms of controlling the quantity, position, and size of focal spots.
Jicheng Wang, Jing Ma, Zhenqiu Shu, Zheng-Da Hu, Xiaojun Wu   +4 more
doaj   +1 more source

Abstract algebra, projective geometry and time encoding of quantum information

, 2005
Algebraic geometrical concepts are playing an increasing role in quantum applications such as coding, cryptography, tomography and computing. We point out here the prominent role played by Galois fields viewed as cyclotomic extensions of the integers ...
Planat, Michel R. P., Saniga, Metod
core   +4 more sources

MacWilliams Identities and Generator Matrices for Linear Codes over ℤ_p⁴[u]/(u² − p³β, pu)

Axioms
Suppose that R=Zp4[u] with u2=p3β and pu=0, where p is a prime and β is a unit in R. Then, R is a local non-chain ring of order p5 with a unique maximal ideal J=(p,u) and a residue field of order p. A linear code C of length N over R is an R-submodule of
Sami Alabiad, Alhanouf Ali Alhomaidhi, Nawal A. Alsarori   +2 more
doaj   +1 more source

On Linear Codes over Local Rings of Order p⁴

Mathematics
Suppose R is a local ring with invariants p,n,r,m,k and mr=4, that is R of order p4. Then, R=R0+uR0+vR0+wR0 has maximal ideal J=uR0+vR0+wR0 of order p(m−1)r and a residue field F of order pr, where R0=GR(pn,r) is the coefficient subring of R.
Sami Alabiad, Alhanouf Ali Alhomaidhi, Nawal A. Alsarori   +2 more
doaj   +1 more source

Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding

, 2012
Diversity coding is a network restoration technique which offers near-hitless restoration, while other state-of-the art techniques are significantly slower.
Avci, Serhat Nazim, Ayanoglu, Ender
core   +1 more source

Coding Theory: the unit-derived methodology

, 2018
The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced.
Hurley, Donny, Hurley, Ted
core   +1 more source

Bijective soft rings with applications

Journal of New Results in Science
In recent years, soft sets have been widely used in many important decision-making real-life problems. In this paper, observing the usage of soft sets in such kind of vital problems, we have introduced the bijective-unitary bijective soft rings. Firstly,
Fatih Koyuncu
doaj   +1 more source