منابع مشابه
Coding for Network Coding
We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include nodeor linkfailures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Kötter and Kschischang, we introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based o...
متن کاملNetwork Coding Theory Network Coding Theory
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. For those organizations that have been granted a photocopy license, a separate system of payment has been arranged. Authorization does not extend to othe...
متن کاملNetwork coding
In the network coding problem, there are k commodities each with an associated message Mi, a set of sources that know Mi and a set of sinks that request Mi. Each edge in the graph may transmit any function of the messages. These functions define a network coding solution. We explore three topics related to network coding. First, for a model in which the messages and the symbols transmitted on e...
متن کاملNetwork Coding, Algebraic Coding, and Network Error Correction
This paper discusses the relation between network coding, (classical) algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establish that linear multicast and its str...
متن کاملNetwork Coding Bounds 17.1 Network Coding 17.1.1 Upper Bound
Start with a directed acyclic graph (DAG) with a single sender and many receivers, where each receiver has k-edge connectivity from the sender. We assume that each edge has unit capacity, say, 1 bit/second. If our initial DAG does not meet this criterion, we can easily construct one that does: first, divide edge capacities by their greatest common divisor, then replace each c-capacity edge with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE ESS Fundamentals Review
سال: 2011
ISSN: 1882-0875
DOI: 10.1587/essfr.5.162