Full Non-Binary Constant-Weight Codes

A Kuznetsov, N Kryvinska, A Kiian, O Smirnov… - SN Computer …, 2021 - Springer
This paper presents the research results of mixed base number systems using binomial
representation of numbers. It also shows the investigated non-linear coding techniques with …

A class of optimal p-ary codes from one-weight codes over Fp [u]

M Shi, S Zhu, S Yang - Journal of the Franklin Institute, 2013 - Elsevier
We characterize the structures and properties of one-homogeneous weight linear codes
[Formula: see text] over Fp [u]/〈 um〉 of type [Formula: see text] with one unique nonzero …

[หนังสือ][B] Perfect codes and related structures

T Etzion - 2022 - World Scientific
Error-correcting codes were introduced to combat errors in communication channels,
storage devices, and other computerized systems. In each such system, the information may …

Dynamic threshold schemes for multi-level non-volatile memories

F Sala, R Gabrys, L Dolecek - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
In non-volatile memories, reading stored data is typically done through the use of
predetermined fixed thresholds. However, due to problems commonly affecting such …

Constant-composition codes for maximum likelihood detection without CSI in diffusive molecular communications

V Jamali, A Ahmadzadeh, N Farsad… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Instantaneous or statistical channel state information (CSI) is needed for most detection
schemes developed for molecular communication (MC) systems. Since the MC channel …

Approximate generalized Steiner systems and near-optimal constant weight codes

M Liu, C Shangguan - Journal of Combinatorial Theory, Series A, 2025 - Elsevier
Constant weight codes (CWCs) and constant composition codes (CCCs) are two important
classes of codes that have been studied extensively in both combinatorics and coding …

Optimal ternary constant-weight codes of weight four and distance six

H Zhang, G Ge - IEEE transactions on information theory, 2010 - ieeexplore.ieee.org
Recently, Chee and Ling (“Constructions for q-ary constant-weight codes”, IEEE Trans. Inf.
Theory, vol. 53, no. 1, 135–146, Jan. 2007) introduced a new combinatorial construction for …

A family of diameter perfect constant-weight codes from Steiner systems

M Shi, Y **a, DS Krotov - Journal of Combinatorial Theory, Series A, 2023 - Elsevier
If S is a transitive metric space, then| C|⋅| A|≤| S| for any distance-d code C and a set
A,“anticode”, of diameter less than d. For every Steiner S (t, k, n) system S, we show the …

Linear Size Optimal -ary Constant-Weight Codes and Constant-Composition Codes

YM Chee, SH Dau, ACH Ling… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
An optimal constant-composition or constant-weight code of weight w has linear size if and
only if its distance d is at least 2w-1. When d≧2w, the determination of the exact size of such …

Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound

J Kim, H Liu, T Tran - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
We give some natural sufficient conditions for balls in a metric space to have small
intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) …