Back to Results
First PageMeta Content
Discrete mathematics / Coding theory / Information theory / Wireless sensor network / Finite fields / Network coding / Maximum flow problem / Flow network / Max-flow min-cut theorem / Mathematics / Network flow / Graph theory


On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar
Add to Reading List

Document Date: 2005-06-29 17:06:05

Open Document

File Size: 130,12 KB

Share Result on Facebook

City

Lausanne / New York / Chicago / Murray Hill NJ / /

Company

John Wiley & Sons Inc. / PPL / Vodafone / On networks / Lucent Technologies / /

Country

Switzerland / United States / Italy / /

/

Facility

Aref Networks Niranjan Ratnakar Gerhard Kramer Coordinated Science Laboratory University of Illinois / Monticello / Rutgers University / University of Illinois Subaward No. / /

IndustryTerm

overall network / relay networks / wireless erasure networks / deterministic relay networks / noise-free network / point-to-point link network / communication network / packet networks / wireless networks / packet erasure networks / /

NaturalFeature

Mountain Ave. Murray Hill NJ / /

Organization

University of Illinois / University of Illinois Subaward / National Science Foundation / Rutgers University / Board of Trustees / U.S. Securities and Exchange Commission / /

Person

Tracey Ho / Stanford Univeristy / Riva del Garda / Aref / Ralf Koetter / /

Position

general network models / /

ProgrammingLanguage

R / C / /

ProvinceOrState

Illinois / British Columbia / New York / /

PublishedMedium

IEEE Transactions on Information Theory / /

Technology

Polynomial time algorithms / /

SocialTag