A. Laaksonen

collaborators

2 papers

cs.IT2019

Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns

Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen +1

We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a…

cs.IT2016

Constructing error-correcting binary codes using transitive permutation groups

Antti Laaksonen, Patric R. J. Östergård

Let $A_{2} (n, d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$ . In this paper we present the following new lower bounds: $A_{2} (18, 4) \geq 5632$ , $A_2(21,4…