New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2
Work
Year: 2013
Type: article
Abstract: Let $$\mathbb{C }$$ be a code of length $$n$$ over an alphabet of $$q$$ letters. The descendant code $$\mathsf{desc}(\mathbb C _0)$$ of $$\mathbb C _0 = \{\mathbf{c}^1, \mathbf{c}^2, \ldots , \mathbf{... more
Source: Designs Codes and Cryptography
Institutions Guangxi Normal University, National Yang Ming Chiao Tung University, University of Tsukuba, National University of Kaohsiung
Cites: 27
Cited by: 16
Related to: 10
FWCI: 1.468
Citation percentile (by year/subfield): 79.65
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890