Results 31 to 40 of about 9,399 (155)

On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3ps Over Fpm + uFpm

open access: yesIEEE Access, 2023
Let $p\not =3$ be any prime. In this paper, we completely determine symbol-triple distance of all $\gamma $ -constacyclic codes of length $3p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , where
Hai Q. Dinh   +3 more
doaj   +1 more source

Some New Classes of Entanglement-Assisted Quantum MDS Codes Derived From Constacyclic Codes

open access: yesIEEE Access, 2019
Although quantum maximal-distance-separable (MDS) codes that satisfy the quantum singleton bound have become an important research topic in the quantum coding theory, it is not an easy task to search for quantum MDS codes with the minimum distance that ...
Jianzhang Chen   +4 more
doaj   +1 more source

Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and $K-1$

open access: yesIEEE Access, 2019
A locally repairable code (LRC) is a [n, k, d] linear code with length n, dimension k, minimum distance d and locality r, which means that every code symbol can be repaired by at most r other symbols.
Yichong Xia, Bin Chen
doaj   +1 more source

On nearly-MDS expander codes [PDF]

open access: yesInternational Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
A construction of graph codes is presented that approaches the singleton bound as the alphabet size goes to infinity. These codes can be decoded by a combined error-erasure decoder whose time complexity grows linearly with the code length.
Ron M. Roth, Vitaly Skachek
openaire   +1 more source

MDS Symbol-Pair Repeated-Root Constacylic Codes of Prime Power Lengths Over $\mathbb F_{p^m}+ u \mathbb F_{p^m}$

open access: yesIEEE Access, 2019
MDS codes have the highest possible error-detecting and error-correcting capability among codes of given length and size. Let p be any prime, and s, m be positive integers.
H. Q. Dinh   +5 more
doaj   +1 more source

Applications of Constacyclic Codes to Some New Entanglement-Assisted Quantum MDS Codes

open access: yesIEEE Access, 2019
Generally, it is not easy to construct quantum maximal-distance-separable (MDS) codes with the minimum distance greater than $\frac {q}{2}+1$ . The minimum distance of quantum MDS codes can achieve $\frac {q}{2}+1$ or exceed $\frac {q}{2}+1$ by ...
Jianzhang Chen   +5 more
doaj   +1 more source

Perceptions of and barriers to ethical promotion of pharmaceuticals in Pakistan: perspectives of medical representatives and doctors

open access: yesBMC Medical Ethics, 2021
Background In Pakistan, drug promotion practices, ethical or unethical, have rarely been in the spotlight. We aimed to assess the perception and barriers of medical representatives (MRs) and doctors (MDs) regarding ethical promotion of pharmaceuticals in
Rehan Gul   +8 more
doaj   +1 more source

Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps

open access: yesIEEE Access, 2021
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length $6p^{s}$ over $\mathbb F_{p^{m}}$ .
Hai Q. Dinh   +3 more
doaj   +1 more source

On MDS elliptic codes

open access: yesDiscrete Mathematics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On MDS negacyclic LCD codes

open access: yesFilomat, 2019
Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and detecting capabilities for fixed length and dimension. The construction of linear codes that are both LCD and MDS is a
Sarı, Mustafa, Köroğlu, Mehmet Emin
openaire   +5 more sources

Home - About - Disclaimer - Privacy