Sökning: "Efraim Laksman"
Hittade 2 avhandlingar innehållade orden Efraim Laksman.
1. Bounds on the Performance of PSK Block Codes
Sammanfattning : In wireless communication, the minimum Euclidean distance between codewords is a major factor for the ability to correct errors in messages, and it is of interest to maximize the minimum Euclidean distance. The thesis improves previously established general upper bounds on minimum Euclidean distance of phase shift keying block codes. LÄS MER
2. Combinatorial Optimization : Three Applications
Sammanfattning : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . LÄS MER
Resultatsidor:
1