Sándor Györi

Learn More
The signature coding for M active users out of T total users over a multiple access OR channel is considered. The mathematical problem is equivalent to the M -coverfree problem of extremal set theory. We survey the upper and lower bounds on the minimal code word length n(T,M), and present some code constructions. According to the current state of the(More)
A new case of Lhermitte-Duclos disease was recognized as an accidental finding during the autopsy of a 58-year-old male who had died because of acute enteritis and shock-induced cardiac failure. Gross examination revealed focally disturbed cerebellar cortical structure in two foci. Microscopical investigation resulted in findings typical of Lhermitte-Duclos(More)
Detailed knowledge about the traffic mixture is essential for network operators and administrators, as it is a key input for numerous network management activities. Several traffic classification approaches co-exist in the literature, but none of them performs well for all different application traffic types present in the Internet. In this study we compare(More)
The possibility of early detection of asbestos-related respiratory diseases was examined on the basis of four x-ray abnormalities, namely, pulmonary fibrosis, pleural plaque, diffuse pleural thickening and diaphragmatic calcification, in a group of workers exposed to chrysotile asbestos. The frequency of these phenomena was compared to the unexposed control(More)
A T user multiple access collision channel without feedback is considered where the channel inputs are called packets. The packets take values from non-binary input alphabet. It is supposed that at most M users are active, i.e., are communicating simultaneously (2 ≤ M T ). We are looking for codes and protocol sequences of users of minimum length such that(More)
  • 1