| 2008 |
|---|
| 24 | EE | Giannakis Antoniou,
Lynn Margaret Batten,
Parampalli Udaya:
Designing Information Systems Which Manage or Avoid Privacy Incidents.
EuroISI 2008: 131-142 |
| 23 | EE | Parampalli Udaya,
Serdar Boztas:
On Partial Correlations of Various Z4 Sequence Families.
SETA 2008: 332-344 |
| 22 | EE | Giannakis Antoniou,
Lynn Margaret Batten,
Parampalli Udaya:
A Trusted Approach to E-Commerce.
Secure Data Management 2008: 119-132 |
| 21 | EE | Abdun Naser Mahmood,
Christopher Leckie,
Parampalli Udaya:
An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis.
IEEE Trans. Knowl. Data Eng. 20(6): 752-767 (2008) |
| 2007 |
|---|
| 20 | EE | Abdun Naser Mahmood,
Christopher Leckie,
Parampalli Udaya:
A scalable sampling scheme for clustering in network traffic analysis.
Infoscale 2007: 38 |
| 19 | EE | Giannakis Antoniou,
Parampalli Udaya,
Lynn Margaret Batten:
Monitoring Employees' Emails without Violating Their Privacy Right.
PDCAT 2007: 46-50 |
| 18 | EE | Xiaohu Tang,
Parampalli Udaya:
A Note on the Optimal Quadriphase Sequences Families.
IEEE Transactions on Information Theory 53(1): 433-436 (2007) |
| 17 | EE | Xiaohu Tang,
Parampalli Udaya,
Pingzhi Fan:
Generalized Binary Udaya-Siddiqi Sequences.
IEEE Transactions on Information Theory 53(3): 1225-1230 (2007) |
| 2006 |
|---|
| 16 | EE | Abdun Naser Mahmood,
Christopher Leckie,
Parampalli Udaya:
Echidna: Efficient Clustering of Hierarchical Data for Network Traffic Analysis.
Networking 2006: 1092-1098 |
| 2005 |
|---|
| 15 | EE | Xin-Wen Wu,
Margreta Kuijper,
Parampalli Udaya:
A root-finding algorithm for list decoding of Reed-Muller codes.
IEEE Transactions on Information Theory 51(3): 1190-1196 (2005) |
| 14 | EE | Xiaohu Tang,
Parampalli Udaya,
Pingzhi Fan:
A new family of nonbinary sequences with three-level correlation property and large linear span.
IEEE Transactions on Information Theory 51(8): 2906-2914 (2005) |
| 2004 |
|---|
| 13 | EE | Xiaohu H. Tang,
Parampalli Udaya,
Pingzhi Z. Fan:
Quadriphase Sequences Obtained from Binary Quadratic Form Sequences.
SETA 2004: 243-254 |
| 12 | EE | Xiaohu H. Tang,
Parampalli Udaya,
Pingzhi Z. Fan:
New Families of p-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Span.
SETA 2004: 255-265 |
| 2003 |
|---|
| 11 | | Kathy J. Horadam,
Parampalli Udaya:
A New Class of Ternary Cocyclic Hadamard Codes.
Appl. Algebra Eng. Commun. Comput. 14(1): 65-73 (2003) |
| 2002 |
|---|
| 10 | | Kathy J. Horadam,
Parampalli Udaya:
A New Construction of Central Relative (pa, pa, pa, 1)-Difference Sets.
Des. Codes Cryptography 27(3): 281-295 (2002) |
| 2001 |
|---|
| 9 | EE | Parampalli Udaya,
Serdar Boztas:
On the Aperiodic Correlation Function of Galois Ring m-Sequences.
AAECC 2001: 229-238 |
| 8 | EE | Alexis Bonnecaze,
Patrick Solé,
Parampalli Udaya:
Tricolore 3-designs in Type III codes.
Discrete Mathematics 241(1-3): 129-138 (2001) |
| 2000 |
|---|
| 7 | EE | Parampalli Udaya,
M. U. Siddiqi:
Generalized GMW Quadriphase Sequences Satisfying the Welch Bound with Equality.
Appl. Algebra Eng. Commun. Comput. 10(3): 203-225 (2000) |
| 6 | | Kathy J. Horadam,
Parampalli Udaya:
Cocyclic Hadamard codes.
IEEE Transactions on Information Theory 46(4): 1545-1550 (2000) |
| 1999 |
|---|
| 5 | | Alexis Bonnecaze,
Parampalli Udaya:
Cyclic Codes and Self-Dual Codes Over F2 + uF2.
IEEE Transactions on Information Theory 45(4): 1250-1255 (1999) |
| 4 | | Parampalli Udaya,
Alexis Bonnecaze:
Decoding of cyclic codes over F2 + µF2.
IEEE Transactions on Information Theory 45(6): 2148-2157 (1999) |
| 1998 |
|---|
| 3 | EE | Parampalli Udaya,
M. U. Siddiqi:
Optimal and Suboptimal Quadriphase Sequences Derived from Maximal Length Sequences over Z4.
Appl. Algebra Eng. Commun. Comput. 9(2): 161-191 (1998) |
| 2 | | Parampalli Udaya,
M. U. Siddiqi:
Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings.
IEEE Transactions on Information Theory 44(4): 1492-1503 (1998) |
| 1996 |
|---|
| 1 | | Parampalli Udaya,
M. U. Siddiqi:
Optimal biphase sequences with large linear complexity derived from sequences over Z4.
IEEE Transactions on Information Theory 42(1): 206-216 (1996) |
