Age of information for periodic status updates under sequence based scheduling
This paper considers a system in which multiple users send periodically generated status
information to a common access point (AP) over a collision channel. To avoid high …
information to a common access point (AP) over a collision channel. To avoid high …
Constant weight conflict-avoiding codes
K Momihara, M Müller, J Satoh, M Jimbo - SIAM Journal on Discrete …, 2008 - SIAM
A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of
length n and weight k satisfying 0≤t≤n-1x_itx_j,t+s≤λ for any distinct codewords …
length n and weight k satisfying 0≤t≤n-1x_itx_j,t+s≤λ for any distinct codewords …
Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3
M Mishima, HL Fu, S Uruno - Designs, Codes and Cryptography, 2009 - Springer
A conflict-avoiding code of length n and weight k is defined as a set C ⊆ {0, 1\}^ n of binary
vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic …
vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic …
A general upper bound on the size of constant-weight conflict-avoiding codes
Conflict-avoiding codes are used in the multiple-access collision channel without feedback.
The number of codewords in a conflict-avoiding code is the number of potential users that …
The number of codewords in a conflict-avoiding code is the number of potential users that …
Optimal conflict-avoiding codes of even length and weight 3
HL Fu, YH Lin, M Mishima - IEEE transactions on information …, 2010 - ieeexplore.ieee.org
Direct constructions for optimal conflict-avoiding codes of length n≡48 and weight 3 are
provided by bringing in a new concept called an extended odd sequence. Constructions for …
provided by bringing in a new concept called an extended odd sequence. Constructions for …
Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
K Momihara - Designs, Codes and Cryptography, 2007 - Springer
A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of Z _n
such that Δ (x) ∩ Δ (y)= ∅ holds for any x, y ∈ C, x\not= y, where Δ (x)={ji\,|\, i, j ∈ x, i\not= j\} …
such that Δ (x) ∩ Δ (y)= ∅ holds for any x, y ∈ C, x\not= y, where Δ (x)={ji\,|\, i, j ∈ x, i\not= j\} …
Optimal 2-D -optical Orthogonal Codes
X Wang, Y Chang, T Feng - IEEE Transactions on information …, 2012 - ieeexplore.ieee.org
Optical orthogonal codes are commonly used as signature codes for optical code-division
multiple access systems. So far, research on 2-D optical orthogonal codes has mainly …
multiple access systems. So far, research on 2-D optical orthogonal codes has mainly …
Schedule sequence design for broadcast in multi-channel ad hoc networks
Ultra-reliable and low-latency communication (URLLC) is of capital importance for the 5G
wireless networks and has received a lot of attention recently. Motivated by the hard delay …
wireless networks and has received a lot of attention recently. Motivated by the hard delay …
Design and construction of protocol sequences: Shift invariance and user irrepressibility
Protocol sequences are used for channel access in the collision channel without feedback.
Each user is assigned a deterministic zero-one pattern, called protocol sequence. The zeros …
Each user is assigned a deterministic zero-one pattern, called protocol sequence. The zeros …
Optimal conflict-avoiding codes of odd length and weight three
A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of Z _ n
such that Δ (x) ∩ Δ (y)= ∅ for any x, y ∈ C, x ≠ y, where Δ (x)={ab:\, a, b ∈ x, a ≠ b\}. Let …
such that Δ (x) ∩ Δ (y)= ∅ for any x, y ∈ C, x ≠ y, where Δ (x)={ab:\, a, b ∈ x, a ≠ b\}. Let …