Results 241 to 250 of about 9,296 (263)
Some of the next articles are maybe not open access.

The graph of 4-ary simplex codes of dimension 2

Finite Fields and Their Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Kwiatkowski, Mark Pankov
openaire   +2 more sources

On ℤ4-Simplex Codes and Their Gray Images

1999
In [7] Rains has shown that for any linear code C over Z4, dH, the minimum Hammimg distance of C and dL, the minimum Lee distance of C satisfy dH ≥ ⌈dL/2⌉. C is said to be of type α(β) if dH = ⌈dL/2⌉ (dH > ⌈dL/2⌉). In this paper we define Simplex codes of type α and β, namely, Skα and Skβ, respectively over Z4.
Mahesh C. Bhandari   +2 more
openaire   +1 more source

Structural Extension of Polar Codes via Simplex Kernels

IEEE Transactions on Communications, 2020
In this paper, we introduce a structural extension method of polar codes as a new code modification method. Structural extension is a systematic method of generating additional codeword bits from the mother code by selecting intermediate bits obtained in the middle of the polar encoding. We start by studying simplex-extension from a $2\times 2$
Min Jang   +4 more
openaire   +1 more source

Projective linear codes and their simplex complementary codes

Journal of Algebra
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hao Chen, Conghui Xie
openaire   +2 more sources

Evaluation of Simplex Codes for Photoacoustic Coded Excitation

2009
In biomedical photoacoustics (PA) ultrasound is generated by laser irradiation of tissue. Usually, PA signals are generated by Nd:YAG lasers, but it would be attractive to use less expensive laser diodes instead. Although laser diodes exhibit low pulse energy, the pulse repetition frequency (PRF) of pulsed laser diodes is much higher than the PRF of Nd:
Martin P. Mienkina   +5 more
openaire   +1 more source

The covering radius for the Lee, euclidean and homogeneous distance of the Simplex codes and related codes

Journal of Applied Mathematics and Computing
Minjia Shi, Xingxing Xu, Patrick Sole
exaly   +2 more sources

Performance of Simplex Signaling in Circular Trellis-Coded Modulation

Digital Signal Processing, 2001
Abstract Alder, F. A., Dill, J. C., and Lindsey, A. R., Performance of Simplex Signaling in Circular Trellis-Coded Modulation, Digital Signal Processing11 (2001) 159–167 This paper presents measures of performance of simplex signaling in a circular trellis-coded modulation (CTCM) scheme. Background is given on both CTCM and simplex signaling.
Frank A. Alder   +2 more
openaire   +1 more source

Information rate in a continuous channel for regular-simplex codes

IEEE Transactions on Information Theory, 1960
M equally probable symbols may be encoded as continuous waveforms whose sample values are the coordinates of the vertices of a regular simplex in N dimensions. These vertices or code points, therefore, are equally spaced, and the resulting waveforms are adapted particularly to low signal-to-noise communication systems.
openaire   +1 more source

On symbol-pair weight distribution of MDS codes and simplex codes over finite fields

Cryptography and Communications, 2020
Jinquan Luo, Luo Jinquan
exaly  

Home - About - Disclaimer - Privacy