BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Michel Kulhandjian (University of Ottawa\, Canada)
DTSTART:20211203T140000Z
DTEND:20211203T150000Z
DTSTAMP:20260423T021228Z
UID:YMC/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/YMC/28/">Uni
 quely Decodable Code-Division via Augmented Sylvester-Hadamard Matrices</a
 >\nby Michel Kulhandjian (University of Ottawa\, Canada) as part of Yereva
 n Mathematical Colloquium\n\n\nAbstract\nWe consider the problem of design
 ing binary antipodal uniquely decodable (errorless) code sets for overload
 ed codedivision multiplexing applications where the number of signals K is
  larger than the code length L. Our proposed errorless code set design aim
 s at identifying the maximum number of columns that can be potentially app
 ended to a Sylvester-Hadamard matrix of order L\, while maintaining the er
 rorless code property. In particular\, we derive formally the maximum numb
 er of columns that may be appended to the Sylvester-Hadamard matrix of ord
 er L = 8 and use this result as a seed to produce an infinite sequence of 
 designs in increasing L. In the noiseless transmission case\, a simple alg
 orithm is developed to uniquely decode all signals. In additive white Gaus
 sian noise (AWGN)\, a slab-sphere decoding scheme can be utilized for effi
 cient and effective decoding.\n
LOCATION:https://researchseminars.org/talk/YMC/28/
END:VEVENT
END:VCALENDAR