Results 11 to 20 of about 19,375 (263)

Punctured Binary Simplex Codes as LDPC codes [PDF]

open access: yes2022 61st FITCE International Congress Future Telecommunications: Infrastructure and Sustainability (FITCE), 2022
Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have received a great deal of attention recently, because of their performance and flexibility of operation, in wireless and mobile radio channels, as well as in cable transmission ...
Massimo Battaglioni   +1 more
openaire   +3 more sources

Essential idempotents and simplex codes [PDF]

open access: yesJournal of Algebra Combinatorics Discrete Structures and Applications, 2017
We define essential idempotents in group algebras and use them to prove that every mininmal abelian non-cyclic code is a repetition code.Also we use them to prove that every minimal abelian code is equivalent to a minimal cyclic code of the same length.Finally, we show that a binary cyclic code is simplex if and only if is of length of the form n = 2 k
Gladys Chalom   +2 more
openaire   +6 more sources

Optimal $$(2,\delta )$$ locally repairable codes via punctured simplex codes [PDF]

open access: yesDesigns, Codes and Cryptography, 2023
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $(2, δ)$-LRCs over $\mathbb{F}_q$ with flexible parameters. Firstly, employing techniques from finite geometry, we introduce a simple yet useful condition to ensure that a ...
Yue Gao 0001   +4 more
openaire   +3 more sources

Recovery Sets of Subspaces From a Simplex Code [PDF]

open access: yesIEEE Transactions on Information Theory
Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question: what is the maximum number of possible pairwise disjoint recovery sets for each recovered element?
Yeow Meng Chee   +3 more
openaire   +4 more sources

Validity of the coding for herpes simplex encephalitis in the Danish National Patient Registry [PDF]

open access: yesClinical Epidemiology, 2016
Laura Krogh Jørgensen,1 Lars Skov Dalgaard,1 Lars Jørgen Østergaard,1 Nanna Skaarup Andersen,2 Mette Nørgaard,3 Trine Hyrup Mogensen1 1Department of Infectious Diseases, Aarhus University Hospital, Aarhus, 2Department of ...
Jørgensen LK   +5 more
doaj   +3 more sources

Raman-based distributed temperature sensor using simplex code and gain controlled edfa [PDF]

open access: yes, 2020
In this work we present a comparison between simplex coded and optical amplified simplex coded Raman based Distributed Temperature Sensing (DTS). An increase in performance is demonstrated using erbium doped fiber amplifier (EDFA) with proper gain ...
Penze, R. S.   +6 more
core   +4 more sources

Perfect codes in the discrete simplex [PDF]

open access: yesDesigns, Codes and Cryptography, 2013
We study the problem of existence of (nontrivial) perfect codes in the discrete $ n $-simplex $ Δ_{\ell}^n := \left\{ \begin{pmatrix} x_0, \ldots, x_n \end{pmatrix} : x_i \in \mathbb{Z}_{+}, \sum_i x_i = \ell \right\} $ under $ \ell_1 $ metric. The problem is motivated by the so-called multiset codes, which have recently been introduced by the authors ...
Mladen Kovacevic 0001   +1 more
openaire   +3 more sources

DNA Code Design Based on the Cosets of Codes over Z4

open access: yesMathematics, 2023
DNA code design is a challenging problem, and it has received great attention in the literature due to its applications in DNA data storage, DNA origami, and DNA computing. The primary focus of this paper is in constructing new DNA codes using the cosets
Adel N. Alahmadi   +2 more
doaj   +1 more source

Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution [PDF]

open access: yesمجله مدل سازی در مهندسی, 2019
In this research, SALCHOW algorithm has been developed to solve linear programming problems. In each step SLACHOW moves towards the constrained gradient of the objective function, so that it always remains within the feasible region.
Mohamad Nekufar   +1 more
doaj   +1 more source

The Simplification of Procedures in Portuguese Administrative Law

open access: yesAdministrative Sciences, 2022
The present paper intends to provide an overview and a critical assessment of the administrative simplification policies implemented in Portugal over the past 20+ years.
João Tiago Silveira   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy