Highly symmetric expanders
Expander graphs are relevant to theoretical computer science in addition to the construction of high-performance switching networks. In communication network applications, a high degree of symmetry in the underlying topology is often advantageous, as it may reduce the complexity of designing and ana...
Saved in:
Main Authors: | Chee, Yeow Meng, Ling, San |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96423 http://hdl.handle.net/10220/9865 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On viterbi-like algorithms and their application to Reed–Muller codes
by: Ling, San, et al.
Published: (2013) -
Constructions for q-ary constant-weight codes
by: Chee, Yeow Meng, et al.
Published: (2009) -
Hulls of cyclic and negacyclic codes over finite fields
by: Sangwisut, Ekkasit, et al.
Published: (2015) -
Cryptanalysis and design of lightweight symmetric-key cryptography
by: Sim, Siang Meng
Published: (2018) -
Standardized signature algorithms on ultra-constrained 4-bit MCU
by: Chen, Chien-Ning, et al.
Published: (2013)