The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

T. Aaron Gulliver: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada
    Binary Optimal Linear Rate 1/2 Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:462-471 [Conf]
  2. T. Aaron Gulliver, Masaaki Harada
    Optimal Double Circulant Z4-Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:122-128 [Conf]
  3. T. Aaron Gulliver, Masaaki Harada
    Certain Self-Dual Codes over Z4 and the Odd Leech Lattice. [Citation Graph (0, 0)][DBLP]
    AAECC, 1997, pp:130-137 [Conf]
  4. Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
    On Senary Simplex Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:112-121 [Conf]
  5. Hao Zhang, Wei Li, T. Aaron Gulliver
    Biorthogonal Pulse Position Modulation for Time-Hopping UWB Systems. [Citation Graph (0, 0)][DBLP]
    CNSR, 2005, pp:209-213 [Conf]
  6. Yongsheng Shi, T. Aaron Gulliver
    An Energy-Efficient MAC Protocol for Mobile Ad hoc Networks. [Citation Graph (0, 0)][DBLP]
    CNSR, 2006, pp:76-88 [Conf]
  7. Hao Zhang, Wei Li, T. Aaron Gulliver
    Performance Analysis of Non-Orthogonal Pulse Position Modulation for Time-Hopping UWB Transmission. [Citation Graph (0, 0)][DBLP]
    CNSR, 2007, pp:287-293 [Conf]
  8. A. Ghassemi, T. Aaron Gulliver
    PTS Peak Power Reduction of OFDM Signals with Low Complexity IFFTs. [Citation Graph (0, 0)][DBLP]
    CNSR, 2007, pp:85-92 [Conf]
  9. Wei Li, T. Aaron Gulliver
    Performance of Hybrid Decision SIC with Transmit Diversity. [Citation Graph (0, 0)][DBLP]
    International Conference on Wireless Networks, 2004, pp:935-938 [Conf]
  10. Yihai Zhang, T. Aaron Gulliver
    A dual mode decision feedback equalizer employing the conjugate gradient algorithm. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2004, pp:41-44 [Conf]
  11. Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord
    Trellis Complexity of Linear Block Codes via Atomic Codewords. [Citation Graph (0, 0)][DBLP]
    Information Theory and Applications, 1995, pp:130-148 [Conf]
  12. T. Aaron Gulliver, Vijay K. Bhargava
    Some Best Rate 1/p Quasi-Cyclic Codes over GF(5). [Citation Graph (0, 0)][DBLP]
    Information Theory and Applications, 1995, pp:28-40 [Conf]
  13. Rumen N. Daskalov, T. Aaron Gulliver
    Bounds on Minimum Distance for Linear Codes over GF(5). [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:9, n:6, pp:547-558 [Journal]
  14. Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada
    Optimal Formally Self-Dual Codes over F5 and F7. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:3, pp:227-236 [Journal]
  15. Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord
    The Minimal Generator Matrix of a Vector Space. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:10, n:1, pp:1-14 [Journal]
  16. T. Aaron Gulliver, Patric R. J. Östergård
    Improved Bounds for Quaternary Linear Codes of Dimension 6. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1998, v:9, n:2, pp:153-159 [Journal]
  17. Morteza Esmaeili, T. Aaron Gulliver
    On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:74, n:, pp:- [Journal]
  18. Morteza Esmaeili, M. R. Yazdani, T. Aaron Gulliver
    Optimal Binary Linear Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  19. T. Aaron Gulliver
    New Linear Codes of Dimensions 5 and 6 over GF(8). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:65, n:, pp:- [Journal]
  20. T. Aaron Gulliver, Vijay K. Bhargava
    Some Nonbinary Power Residue Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  21. T. Aaron Gulliver, Vijay K. Bhargava
    Improvements to the bounds on optimal binary linear codes of dimensions 11 and 12. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:44, n:, pp:- [Journal]
  22. T. Aaron Gulliver, Vijay K. Bhargava
    Projective Spaces and Quasi-Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:48, n:, pp:- [Journal]
  23. T. Aaron Gulliver, Masaaki Harada
    Double Circulant Self-Dual Codes over GF(5). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  24. T. Aaron Gulliver, Patric R. J. Östergård
    New Binary Linear Codes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  25. Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura
    Higher Weights and Graded Rings for Binary Self-dual Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:121-143 [Journal]
  26. Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada
    Extremal Self-Dual Codes over F2 × F2. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:2, pp:171-186 [Journal]
  27. Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura
    Higher Weights for Ternary and Quaternary Self-Dual Codes*. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:1, pp:97-112 [Journal]
  28. T. Aaron Gulliver, Vijay K. Bhargava
    New Good Rage (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:7, n:3, pp:223-233 [Journal]
  29. T. Aaron Gulliver, Masaaki Harada
    Codes over and Improvements to the Bounds on Ternary Linear Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:22, n:1, pp:89-96 [Journal]
  30. T. Aaron Gulliver, Masaaki Harada
    On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:2, pp:139-145 [Journal]
  31. T. Aaron Gulliver, Masaaki Harada
    Classification of Extremal Double Circulant Formally Self-Dual Even Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:11, n:1, pp:23-35 [Journal]
  32. T. Aaron Gulliver, Masaaki Harada
    Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:11, n:2, pp:141-150 [Journal]
  33. T. Aaron Gulliver, Masaaki Harada
    Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:13, n:3, pp:257-269 [Journal]
  34. T. Aaron Gulliver, Masaaki Harada, Takuji Nishimura, Patric R. J. Östergård
    Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:3, pp:465-471 [Journal]
  35. T. Aaron Gulliver, Nikolai Senkevitch
    Optimal Ternary Linear Rate 1/2 Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:2, pp:167-172 [Journal]
  36. Steven T. Dougherty, T. Aaron Gulliver, John Wong
    Self-dual codes over Z8 and Z9. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:41, n:3, pp:235-249 [Journal]
  37. Koichi Betsumiya, Stelios Georgiou, T. Aaron Gulliver, Masaaki Harada, Christos Koukouvinos
    On self-dual codes over some prime fields. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:37-58 [Journal]
  38. T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim
    Construction of new extremal self-dual codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:81-91 [Journal]
  39. T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim
    Erratum to "Construction of new extremal self-dual codes" [Discrete Mathematics 263 (2003) 81-91]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:207-0 [Journal]
  40. T. Aaron Gulliver, Patric R. J. Östergård
    Binary optimal linear rate 1/2 codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:255-261 [Journal]
  41. T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch
    Optimal linear rate 1/2 codes over F5 and F2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:59-70 [Journal]
  42. T. Aaron Gulliver, Masaaki Harada
    Classification of extremal double circulant self-dual codes of lengths 74-88. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:17, pp:2064-2072 [Journal]
  43. David G. Glynn, T. Aaron Gulliver, Manish K. Gupta
    Linear transformations on codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1871-1880 [Journal]
  44. T. Aaron Gulliver, Patric R. J. Östergård
    Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2001, v:7, n:1, pp:37-46 [Journal]
  45. Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker
    Aperiodic propagation criteria for Boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:5, pp:741-770 [Journal]
  46. T. Aaron Gulliver, Masaaki Harada
    Orthogonal Frames in the Leech Lattice and a Type II Code over Integer 22. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:185-188 [Journal]
  47. T. Aaron Gulliver, Masaaki Harada
    An Optimal Unimodular Lattice in Dimension 39. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:158-161 [Journal]
  48. Amir M. Y. Bigloo, T. Aaron Gulliver, Vijay K. Bhargava
    A Slotted Frequency-Hopped Multiple-Access Network with Packet Combining. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1996, v:14, n:9, pp:1859-1865 [Journal]
  49. Rolands E. Ezers, E. Barry Felstead, T. Aaron Gulliver, James S. Wight
    An Analytical Method for Linear Combining with Application to FFH NCFSK Receivers. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1993, v:11, n:3, pp:454-464 [Journal]
  50. Qiang Wang, T. Aaron Gulliver, Vijay K. Bhargava
    Probability Distribution of DPSK in Tone Interference and Applications to SFH/DPSK. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1990, v:8, n:5, pp:895-906 [Journal]
  51. F. Hendessi, A. Ghayoori, T. Aaron Gulliver
    A speech synthesizer for Persian text using a neural network with a smooth ergodic HMM. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Asian Lang. Inf. Process., 2005, v:4, n:1, pp:38-52 [Journal]
  52. T. Aaron Gulliver, Vijay K. Bhargava
    A Systematic (16, 8) Code for Correcting Double Errors and Detecting Triple-Adjacent Errors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:1, pp:109-112 [Journal]
  53. T. Aaron Gulliver, Vijay K. Bhargava
    Authors' Reply. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:12, pp:1473-1474 [Journal]
  54. Majid Khabbazian, T. Aaron Gulliver, Vijay K. Bhargava
    A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2005, v:54, n:11, pp:1454-1459 [Journal]
  55. Majid Khabbazian, T. Aaron Gulliver, Vijay K. Bhargava
    Double Point Compression with Applications to Speeding Up Random Point Multiplication. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:3, pp:305-313 [Journal]
  56. Andrew C. Reid, T. Aaron Gulliver, Desmond P. Taylor
    Rate-1/2 component codes for nonbinary turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:9, pp:1417-1422 [Journal]
  57. Hao Zhang, Wei Li, T. Aaron Gulliver
    Pulse Position Amplitude Modulation for Time-Hopping Multiple-Access UWB Communications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:8, pp:1269-1273 [Journal]
  58. K. T. Arasu, T. Aaron Gulliver
    Self-dual codes over Fp and weighing matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2051-2055 [Journal]
  59. Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, Akihiro Munemasa
    On type II codes over F4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2242-2248 [Journal]
  60. Rumen N. Daskalov, T. Aaron Gulliver
    New quasi-twisted quaternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2642-2643 [Journal]
  61. Rumen N. Daskalov, T. Aaron Gulliver
    New good quasi-cyclic ternary and quaternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1647-1650 [Journal]
  62. Rumen N. Daskalov, T. Aaron Gulliver, Elena Metodieva
    New ternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1687-1688 [Journal]
  63. Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada
    Extremal binary self-dual codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2036-2047 [Journal]
  64. Morteza Esmaeili, T. Aaron Gulliver, Amir K. Khandani
    On the Pless-construction and ML decoding of the (48, 24, 12) quadratic residue code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1527-1535 [Journal]
  65. Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord
    Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:3, pp:1040-1052 [Journal]
  66. Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord, Samy A. Mahmoud
    A Link Between Quasi-Cyclic Codes and Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:431-435 [Journal]
  67. T. Aaron Gulliver
    Optimal double circulant self-dual codes over F4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:271-274 [Journal]
  68. T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch
    Optimal quaternary linear rate-1/2 codes of length <18. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1540-1543 [Journal]
  69. T. Aaron Gulliver
    Serf-reciprocal polynomials and generalized Fermat numbers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1149-0 [Journal]
  70. T. Aaron Gulliver
    New optimal ternary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1182-1185 [Journal]
  71. T. Aaron Gulliver
    New optimal quaternary linear codes of dimension 5. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2260-2265 [Journal]
  72. T. Aaron Gulliver
    Improvements to the bounds on optimal ternary linear codes of dimension 6. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1632-1638 [Journal]
  73. T. Aaron Gulliver, Vijay K. Bhargava
    Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:552-555 [Journal]
  74. T. Aaron Gulliver, Vijay K. Bhargava
    Nine good rate (m-1)/pm quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1366-0 [Journal]
  75. T. Aaron Gulliver, Vijay K. Bhargava
    Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1369-0 [Journal]
  76. T. Aaron Gulliver, Vijay K. Bhargava
    Twelve good rate (m-r)/pm quasicyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1750-0 [Journal]
  77. T. Aaron Gulliver, Vijay K. Bhargava
    Two new rate 2/p binary quasi-cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1667-0 [Journal]
  78. T. Aaron Gulliver, Vijay K. Bhargava
    New optimal binary linear codes of dimensions 9 and 10. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:314-318 [Journal]
  79. T. Aaron Gulliver, Masaaki Harada
    Weight enumerators of extremal singly-even [60, 30, 12] codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:658-659 [Journal]
  80. T. Aaron Gulliver, Masaaki Harada
    Double Circulant Self-Dual Codes Over Z2k. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3105-3123 [Journal]
  81. T. Aaron Gulliver, Masaaki Harada
    Codes of Lengths 120 and 136 Meeting the Grey-Rankin Bound and Quasi-Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:703-706 [Journal]
  82. T. Aaron Gulliver, Masaaki Harada
    Construction of optimal Type IV self-dual codes over F2+µF2. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2520-2521 [Journal]
  83. T. Aaron Gulliver, Jon-Lark Kim
    Circulant based extremal additive self-dual codes over GF(4). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:359-366 [Journal]
  84. T. Aaron Gulliver, Patric R. J. Östergård
    Improved bounds for ternary linear codes of dimension 7. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1377-1381 [Journal]
  85. T. Aaron Gulliver, Nikolai Senkevitch
    On a Class of Self-Dual Codes Derived from Quadratic Residues. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:701-702 [Journal]
  86. Michael Moher, T. Aaron Gulliver
    Cross-Entropy and Iterative Decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3097-3104 [Journal]
  87. David M. Rankin, T. Aaron Gulliver, Desmond P. Taylor
    Asymptotic performance of single parity-check product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2230-2235 [Journal]
  88. Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver
    The Minimum Average Code for Finite Memoryless Monotone Sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:3, pp:955-975 [Journal]
  89. T. Aaron Gulliver, Masaaki Harada
    Extremal double circulant Type II codes over Z4 and construction of 5-(24, 10, 36) designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:129-137 [Journal]
  90. Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada
    Optimal ternary formally self-dual codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:117-135 [Journal]
  91. Masaaki Harada, T. Aaron Gulliver, Hitoshi Kaneta
    Classification of extremal double-circulant self-dual codes of length up to 62. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:127-136 [Journal]
  92. T. Aaron Gulliver
    Two new optimal ternary two-weight codes and strongly regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:83-92 [Journal]
  93. Mark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel
    Deterministic Complexity and Entropy. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:443-461 [Journal]

  94. Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2). [Citation Graph (, )][DBLP]


  95. An Energy Efficient Power Control Protocol for Ad Hoc Networks Using Directional Antennas. [Citation Graph (, )][DBLP]


  96. Distributed Transmission Power Control for Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  97. Low Autocorrelation Fractional PTS Subblocking for PAPR Reduction in OFDM Systems. [Citation Graph (, )][DBLP]


  98. A New Key Establishment Protocol for Limited Resource Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  99. Carrier Frequency Offset Mitigation in OFDM Systems Using Efficient Tone Reservation. [Citation Graph (, )][DBLP]


  100. A Multi-channel QoS Model for Random Access Systems. [Citation Graph (, )][DBLP]


  101. Repetition Code Subblocking for Partial Transmit Sequence OFDM. [Citation Graph (, )][DBLP]


  102. Can We Multiplex IPTV and TCP? [Citation Graph (, )][DBLP]


  103. A Successive Intercarrier Interference Reduction Algorithm for OFDM Systems. [Citation Graph (, )][DBLP]


  104. A Simplified Suboptimal Algorithm for Tone Reservation OFDM. [Citation Graph (, )][DBLP]


  105. Improving the Performance of LP Decoders for Cyclic Codes. [Citation Graph (, )][DBLP]


  106. A New PTS for PAPR Reduction by Local Search in GA. [Citation Graph (, )][DBLP]


  107. A Low Complexity IFFT-Based PTS Technique for PAPR Reduction in OFDM Systems. [Citation Graph (, )][DBLP]


  108. Decimation-in-Time FFT Subblocking for Partial Transmit Sequence OFDM. [Citation Graph (, )][DBLP]


  109. Soft-Decision Decoding for Differential Pulse-Position Modulation (DPPM) Over Optical Wireless Communications. [Citation Graph (, )][DBLP]


  110. Optimal Pulse Shaping for Pulse Position Modulation UWB Systems with Sparsity-Driven Signal Detection. [Citation Graph (, )][DBLP]


  111. Sparsity-Driven Multiple Access Ultra-Wideband Signal Detection. [Citation Graph (, )][DBLP]


  112. Multi-mode Access System with Anchor Layer 2/3 Protocol for Beyond 3G Wireless Networks. [Citation Graph (, )][DBLP]


  113. Performance of Differential Pulse-Position Modulation (DPPM) with Concatenated Coding over Indoor Wireless Infrared Communications. [Citation Graph (, )][DBLP]


  114. Blind Polynomial Channel Estimation for OFDM Systems. [Citation Graph (, )][DBLP]


  115. A New Time Synchronization Technique for OFDM Systems. [Citation Graph (, )][DBLP]


  116. Selective Mapping OFDM without Side Information Using a Low Complexity ML Decoder. [Citation Graph (, )][DBLP]


  117. A New Distributed Range-free Localization Algorithm for Wireless Networks. [Citation Graph (, )][DBLP]


  118. A Store-Carry-Forward based Message Dissemination Approach with Local Density Estimation in Vehicular Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  119. A new mutual authentication protocol for GSM networks. [Citation Graph (, )][DBLP]


  120. On the capacity of 60 GHz wireless communications. [Citation Graph (, )][DBLP]


  121. Design of Rate-Compatible Punctured Repeat-Accumulate Codes. [Citation Graph (, )][DBLP]


  122. Performance Analysis of IPTV Traffic in Home Networks. [Citation Graph (, )][DBLP]


  123. A Simple, Two-Level Markovian Traffic Model for IPTV Video Sources. [Citation Graph (, )][DBLP]


  124. Fractional Selective Mapping Using Decimation in Time IFFT/FFT. [Citation Graph (, )][DBLP]


  125. Low Complexity Joint Semiblind Detection for OFDM Systems over Time-Varying Channels. [Citation Graph (, )][DBLP]


  126. Dynamic Spectrum Management for WCDMA and DVB Heterogeneous Systems. [Citation Graph (, )][DBLP]


  127. A Hybrid Key Establishment Protocol for Large Scale Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  128. A Symmetric Polynomial Based Mutual Authentication Protocol for GSM Networks. [Citation Graph (, )][DBLP]


  129. Decoupled phase optimization for partial transmit sequence OFDM. [Citation Graph (, )][DBLP]


  130. An efficient authentication and key management protocol for hierarchical ad hoc sensor networks. [Citation Graph (, )][DBLP]


  131. A low complexity selective mapping to reduce intercarrier interference in OFDM systems. [Citation Graph (, )][DBLP]


  132. On Some Quaternary Self-Orthogonal Codes. [Citation Graph (, )][DBLP]


  133. On the Quaternary Projection of Binary Linear Block Codes. [Citation Graph (, )][DBLP]


  134. Classification of Optimal Linear Z4 Rate 1/2 Codes of Length <= 8. [Citation Graph (, )][DBLP]


  135. Symmetric Designs and Self-Dual Codes over Rings. [Citation Graph (, )][DBLP]


  136. Admission region of triple-play services in wireless home networks. [Citation Graph (, )][DBLP]


  137. On circulant self-dual codes over small fields. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002