221 |
A conflict resolution algorithm for noisy multiaccess channelsRyter, David Mark January 1980 (has links)
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1980. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaf 71. / by David Mark Ryter. / B.S.
|
222 |
Protocols for multi-access channels with continuous entry and noisy feedbackCruz, Rene Leonardo January 1982 (has links)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Includes bibliographical references. / by Rene Leonardo Cruz. / M.S.
|
223 |
Critical analyses of some public-key cryptosystems for high-speed satellite transmission applicationsMa, Moses Hsingwen January 1981 (has links)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Vita. / Bibliography: leaves 83-86. / by Moses Hsingwen Ma. / M.S.
|
224 |
A lower bound to protocol information in data networks.Rohrs, Charles Edward January 1978 (has links)
Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaves 52-53. / M.S.
|
225 |
A unified framework for linear network coding.January 2008 (has links)
Tan, Min. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (p. 35-36). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Previous Work --- p.1 / Chapter 1.2 --- Motivation --- p.2 / Chapter 1.3 --- Contributions --- p.2 / Chapter 1.4 --- Thesis Organization --- p.3 / Chapter 2 --- Linear Network Coding Basics --- p.5 / Chapter 2.1 --- Formulation and Example --- p.5 / Chapter 2.2 --- Some Notations --- p.9 / Chapter 3 --- A Unified Framework --- p.13 / Chapter 3.1 --- Generic Network Codes Revisited --- p.13 / Chapter 3.2 --- A Unified Framework --- p.24 / Chapter 3.3 --- Simplified Proofs --- p.29 / Chapter 4 --- Conclusion --- p.33 / Bibliography --- p.35
|
226 |
Variable-rate linear network coding.January 2007 (has links)
Fong, Lik Hang Silas. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 40). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Linear Network Code --- p.4 / Chapter 2.1 --- Linear Network Code without Link Failures --- p.4 / Chapter 2.1.1 --- Linear Multicast and Linear Broadcast --- p.6 / Chapter 2.2 --- Linear Network Code with Link Failures --- p.8 / Chapter 2.2.1 --- Static Linear Multicast and Static Linear Broadcast --- p.9 / Chapter 3 --- Variable-Rate Linear Network Coding --- p.11 / Chapter 3.1 --- Variable-Rate Linear Network Coding without Link Failures --- p.11 / Chapter 3.1.1 --- Problem Formulation --- p.11 / Chapter 3.1.2 --- Algorithm and Analysis --- p.12 / Chapter 3.2 --- Variable-Rate Linear Network Coding with Link Failures --- p.23 / Chapter 3.2.1 --- Problem Formulation --- p.23 / Chapter 3.2.2 --- Algorithm and Analysis --- p.23 / Chapter 3.3 --- The Maximum Broadcast Rate of Linear Network Code --- p.28 / Chapter 4 --- Conclusion --- p.38 / Bibliography --- p.40
|
227 |
Real-time communications in token ring networks / by Li-Jun Yao.Yao, Li-Jun January 1994 (has links)
Bibliography : leaves 225-232. / xii, 232 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 1994
|
228 |
Algorithms and architectures for low-density parity-check codecs / Chris Howland.Howland, Chris (Christopher John) January 2001 (has links)
"October 10th, 2001." / Errata included. / Bibliography: p. 179-185. / xii, 185 p. : ill. (some col.) ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Looks at algorithms and architectures for implementing low-density parity-check codes to achieve reliable communication of digital data over an unreliable channel. Shows that published methods of finding LDPC codes do not result in good codes. Derives a cost metric for measuring short cycles in a graph due to an edge and proposes an algorithm for constructing codes through the minimisation of the cost metric. An encoding algorithm is derived by considering the parity check matrix as a set of linear simultaneous equations. A parallel architecture for implementing LDPC decoders is proposed and the advantages in terms of throughput and power reduction of this architecture are demonstrated through the implementation of 2 LSPC decoders in a 1.5V 0.16[mu]m CMOS process. / Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 2002
|
229 |
An optimal control approach to dynamic routing in data communication networks : part I--principlesJanuary 1978 (has links)
Franklin H. Moss and Adrian Segall. / Bibliography: p. 72. / "September 1978." / Supported by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183 Technion Research and Development Foundation Ltd. no. 050-383
|
230 |
An optimal control approach to dynamic routing in data communication networks : part II--geometrical interpretationJanuary 1978 (has links)
Franklin H. Moss and Adrian Segall. / Bibliography: p. 42. / "September 1978." / Supported by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183 Technion Research and Development Foundation Ltd. no. 050-383
|
Page generated in 0.2428 seconds