Adelaide Research & Scholarship
Browsing "School of Computer Science" by Author Kan, H.
Showing results 1 to 8 of 8
Preview | Issue Date | Title | Author(s) |
| 2005 | A counterexample for the conjecture on the minimal delay of orthogonal designs with maximal rates | Kan, H.; Shen, H. |
| 2004 | A note on tanner graphs for group block codes and lattices | Kan, H.; Shen, H. |
| 2005 | A relation between the characteristic generators of a linear code and its dual | Kan, H.; Shen, H. |
| 2006 | Lower bounds on the minimal delay of complex orthogonal designs with maximal rates | Kan, H.; Shen, H. |
| 2003 | Nearest lattice point algorithms on semi k-reduced basis | Shen, H.; Kan, H. |
| 2005 | Reliability-latency tradeoffs for data gathering in random-access wireless sensor networks | Zhang, H.; Shen, H.; Kan, H.; GCC 2005 (2005 : Beijing, China) |
| 2009 | The generalization of some trellis properties of linear codes to group codes | Kan, H.; Li, X.; Shen, H. |
| 2005 | Trellis properties of product codes | Kan, H.; Shen, H. |