A new series of optimal tight conflict-avoiding codes of weight 3
type: Item
instance of: scholarly article
title: A new series of optimal tight conflict-avoiding codes of weight 3
zbMATH Open document ID: 1393.94934
author: Miwako Mishima
author: Koji Momihara
published in: Discrete Mathematics
publication date: 2017-02-06T00:00:00Z
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 6680903
zbMATH Keywords: conflict-avoiding code (CAC)
zbMATH Keywords: optimal code
zbMATH Keywords: tight code
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.disc.2016.12.003
OpenAlex ID: W2569706377
cites work: Q3335674
cites work: Q3100152
cites work: Optimal Conflict-Avoiding Codes of Even Length and Weight 3
cites work: Optimal conflict-avoiding codes of odd length and weight three
cites work: Constructions of protocol sequences for multiple access collision channel without feedback
cites work: Q3999066
cites work: On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users
cites work: Conflict-avoiding codes and cyclic triple systems
cites work: Perfect (d,k)-codes capable of correcting single peak-shifts
cites work: Optimal equi-difference conflict-avoiding codes of weight four
cites work: Optimal equi-difference conflict-avoiding codes of odd length and weight three
cites work: New optimal constructions of conflict-avoiding codes of odd length and weight 3
cites work: The collision channel without feedback
cites work: A class of codes for a T active users out of N multiple-access communication system
cites work: Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
cites work: Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
cites work: Constant Weight Conflict-Avoiding Codes
cites work: On perfect \(t\)-shift codes in abelian groups
cites work: Constructions of binary constant-weight cyclic codes and cyclically permutable codes
cites work: Some constructions of conflict-avoiding codes
cites work: Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3
DOI: 10.1016/J.DISC.2016.12.003
description: scientific article; zbMATH DE number 6680903