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:20211210T140000Z
DTEND:20211210T150000Z
DTSTAMP:20260423T021230Z
UID:YMC/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/YMC/38/">Uni
 quely Decodable Code-Division via Augmented Sylvester-Hadamard Matrices\, 
 part 2</a>\nby Michel Kulhandjian (University of Ottawa\, Canada) as part 
 of Yerevan Mathematical Colloquium\n\n\nAbstract\nWe consider the problem 
 of designing binary antipodal uniquely decodable (errorless) code sets for
  overloaded code division multiplexing applications where the number of si
 gnals K is larger than the code length L. Our proposed errorless code set 
 design aims at identifying the maximum number of columns that can be poten
 tially appended to a Sylvester-Hadamard matrix of order L\, while maintain
 ing the errorless code property. In particular\, we derive formally the ma
 ximum number of columns that may be appended to the Sylvester-Hadamard mat
 rix of order L = 8 and use this result as a seed to produce an infinite se
 quence of designs in increasing L. In the noiseless transmission case\, a 
 simple algorithm is developed to uniquely decode all signals. In additive 
 white Gaussian noise (AWGN)\, a slab-sphere decoding scheme can be utilize
 d for efficient and effective decoding.\n
LOCATION:https://researchseminars.org/talk/YMC/38/
END:VEVENT
END:VCALENDAR