Results 201 to 210 of about 2,363,882 (233)

Enhanced output of Fe²⁺/Fe³⁺ liquid energy conversion using a methanol-acetone mixed solvent. [PDF]

RSC Adv
Miyama R, Abe Y, Abe H, Inoue D.
europepmc   +1 more source

Genome rearrangements as double coset Markov chains. [PDF]

J Math Biol
Simper MA.
europepmc   +1 more source

Maximum distance separable symbol-pair codes

2012 IEEE International Symposium on Information Theory Proceedings, 2012
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound.
Yeow Meng Chee, Han Mao Kiah, Chengmin Wang   +2 more
openaire   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring

Applicable Algebra in Engineering, Communications and Computing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abhay Kumar Singh, Paravee Maneejuk, Hai Dinh   +2 more
exaly   +2 more sources

On symbol-pair distance distributions of repeated-root constacyclic codes of length $ 4p^s $ and MDS codes

Advances in Mathematics of Communications
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Madhu Kant Thakur, Abhay Kumar Singh, Hai Dinh   +2 more
exaly   +3 more sources

On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$ and MDS symbol-pair codes

Applicable Algebra in Engineering, Communication and Computing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hai Q. Dinh 0001, Abhay Kumar Singh 0002, Madhu Kant Thakur   +2 more
openaire   +2 more sources

Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

Algebra Colloquium, 2021
Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for
Hai Q. Dinh, Hualu Liu, Roengchai Tansuchat, Thang M. Vo   +3 more
openaire   +1 more source

Symbol-pair distance of some repeated-root constacyclic codes of length $$p^s$$ over the Galois ring $${{\,\mathrm{GR}\,}}(p^a,m)$$

Applicable Algebra in Engineering, Communication and Computing, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hai Q. Dinh 0001, Pramod Kumar Kewat, Nilay Kumar Mondal   +2 more
openaire   +1 more source

On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths

IEEE Transactions on Information Theory, 2018
Let $p$ be a prime, and $\lambda$ be a nonzero element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}
Hai Q. Dinh 0001, Bac Trong Nguyen, Abhay Kumar Singh 0002, Songsak Sriboonchitta   +3 more
openaire   +1 more source

On the symbol-pair distances of repeated-root constacyclic codes of length 2ps

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hai Q. Dinh 0001, Xiaoqiang Wang 0001, Hongwei Liu 0003, Songsak Sriboonchitta   +3 more
openaire   +1 more source