13 citations · 16 across the 5 of their papers we have counts for
5 papers
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
Bader AlBdaiwi, Zaid Hussain, Anton Cerny +1
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. De…
The maximum number of minimal codewords in an code
A. Alahmadi, R. E. L. Aldred, R. dela Cruz +2
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of and An application to graphs with many cycles is given.
The maximum number of minimal codewords in long codes
Adel Alahmadi, R. E. L. Aldred, Romar dela Cruz +2
Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provide lower bounds. In this paper we compare these boun…
Monotonic Sequence Games
M. Albert, R. Aldred, M. Atkinson +4
In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascend…
Restricted permutations and queue jumping
M. H. Albert, R. E. L. Aldred, M. D. Atkinson +3
A connection between permutations that avoid 4231 and a certain queueing discipline is established. It is proved that a more restrictive queueing discipline corresponds to avoiding…