Edwin Soedarmadji

According to our database, Edwin Soedarmadji authored at least 10 papers between 2006 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2008

Finding the Best QoS Path in a Gilbert Channel Network.

Edwin Soedarmadji

Proceedings of the 67th IEEE Vehicular Technology Conference, 2008

Finding the best path in a binary Block Interference network.

Edwin Soedarmadji, Robert J. McEliece

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

The Chinese Generals Problem.

Edwin Soedarmadji

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007

Worst-Case Routing Performance Metrics for Sensor Networks.

Edwin Soedarmadji

Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications, 2007

Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network.

Edwin Soedarmadji, Robert J. McEliece

Proceedings of IEEE International Conference on Communications, 2007

2006

Latin hypercubes and MDS codes.

Edwin Soedarmadji

Discret. Math., 2006

A Dynamic Graph Algorithm for the Highly Dynamic Network Problem.

Edwin Soedarmadji, Robert J. McEliece

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Optimal Routing in the Worst-Case-Error Metric.

Edwin Soedarmadji

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Decentralized Decision Making in the Game of Tic-tac-toe.

Edwin Soedarmadji

Proceedings of the 2006 IEEE Symposium on Computational Intelligence and Games (CIG06), 2006

On Generalized Parity Checks.

Robert J. McEliece, Edwin Soedarmadji

Proceedings of the Applied Algebra, 2006