CAPACITY OF ERASURE NETWORKS UNDER SPATIAL NETWORK CODING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SALMASI M.; GOLESTANI S.J.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF IRANIAN ASSOCIATION OF ELECTRICAL AND ELECTRONICS ENGINEERS Year:2012 | Volume:8 | Issue:2 Page(s): 1-12

Download Full-Text

Persian Verion

View:

1,171

Download:

Cites:

Information Journal Paper

Title

CAPACITY OF ERASURE NETWORKS UNDER SPATIAL NETWORK CODING

Author(s)

SALMASI M. | GOLESTANI S.J. | Issue Writer Certificate

Keywords

NETWORK CODINGQ3

ERASURE NETWORKQ2

CAPACITYQ3

SPATIAL NETWORK CODINGQ3

Abstract

We study the CAPACITY of point-to-point ERASURE NETWORKs under a restricted form of NETWORK CODING to which we refer as spatial NETWORK CODING. In this form of coding, the nodes can not perform coding on successive packets which are received from one incoming link. The coding at a node is restricted to the packets received at the same time slot from different incoming links to the node. In other words, the temporal aspect of coding is absent. We prove that the CAPACITY of a unicast session under spatial NETWORK CODING is the statistical average of the minimum cut of the random graph corresponding to the ERASURE NETWORK. Then, we consider a network with a complete, directed and acyclic graph in which the nodes are erased independently. We prove that the CAPACITY of the network under spatial NETWORK CODING is the same as its CAPACITY under general NETWORK CODING. This shows that temporal coding has no improving effect for this network. Finally, we compare the capacities under different coding schemes for the complete graph with the edges that are erased independently.

Cites

No record.

References

No record.

Cite

APA: Copy

SALMASI, M., & GOLESTANI, S.J.. (2012). CAPACITY OF ERASURE NETWORKS UNDER SPATIAL NETWORK CODING. JOURNAL OF IRANIAN ASSOCIATION OF ELECTRICAL AND ELECTRONICS ENGINEERS, 8(2), 1-12. SID. https://sid.ir/paper/115735/en

Vancouver: Copy

SALMASI M., GOLESTANI S.J.. CAPACITY OF ERASURE NETWORKS UNDER SPATIAL NETWORK CODING. JOURNAL OF IRANIAN ASSOCIATION OF ELECTRICAL AND ELECTRONICS ENGINEERS[Internet]. 2012;8(2):1-12. Available from: https://sid.ir/paper/115735/en

IEEE: Copy

M. SALMASI, and S.J. GOLESTANI, “CAPACITY OF ERASURE NETWORKS UNDER SPATIAL NETWORK CODING,” JOURNAL OF IRANIAN ASSOCIATION OF ELECTRICAL AND ELECTRONICS ENGINEERS, vol. 8, no. 2, pp. 1–12, 2012, [Online]. Available: https://sid.ir/paper/115735/en

Related Journal Papers