default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBahram Honary
Person information
- affiliation: The University of Lancaster, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j35]Abbas Khalid
, Bamidele Adebisi, Rafi Us Shan, Bahram Honary:
Mitigating cyclostationary noise using multi-fold turbo codes on a two-user narrowband power-line binary adder channel. Int. J. Commun. Syst. 33(17) (2020)
2010 – 2019
- 2017
- [j34]Hafiz M. Asif, Bahram Honary, Mirza Tariq Hamayun:
Gaussian integers and interleaved rank codes for space-time block codes. Int. J. Commun. Syst. 30(1) (2017) - 2016
- [j33]Yuhang Yang, Maode Ma, Bahram Honary:
Special Issue on Cognitive-Inspired Network Systems. IEEE Syst. J. 10(1): 290-292 (2016) - 2015
- [j32]Abbas Khalid, Eraj Khan, Bamidele Adebisi, Bahram Honary, Samee U. Khan:
Image transmission using unequal error protected multi-fold turbo codes over a two-user power-line binary adder channel. IET Image Process. 9(5): 395-404 (2015) - 2014
- [j31]Eraj Khan, Ernst M. Gabidulin, Bahram Honary, Hassan Ahmed:
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. Des. Codes Cryptogr. 70(1-2): 231-239 (2014) - [j30]Mohammad Ghamari, Behzad Momahed Heravi, Utz Roedig, Bahram Honary:
Reliability comparison of transmit/receive diversity and error control coding in low-power medium access control protocols. IET Networks 3(4): 284-292 (2014) - [c26]Bamidele Adebisi, Abbas Khalid, Yakubu Tsado, Bahram Honary:
Narrowband PLC channel modelling for smart grid applications. CSNDSP 2014: 67-72 - 2013
- [j29]Ernst M. Gabidulin, Nina I. Pilipchuk, Bahram Honary, Haitham Rashwan:
Information security in a random network coding network. Probl. Inf. Transm. 49(2): 179-191 (2013) - 2012
- [j28]Vit Sipal, Ben Allen, David J. Edwards, Bahram Honary:
Twenty years of ultrawideband: Opportunities and challenges. IET Commun. 6(10): 1147-1162 (2012) - [j27]Hafiz M. Asif, Bahram Honary, Hassan Ahmed:
Multiple-input multiple-output ultra-wide band channel modelling method based on ray tracing. IET Commun. 6(10): 1195-1204 (2012) - [j26]Eraj Khan, Ernst M. Gabidulin, Bahram Honary, Hassan Ahmed:
Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks. IET Wirel. Sens. Syst. 2(2): 108-114 (2012) - [j25]Mohammad Ghamari, Behzad Momahed Heravi, Utz Roedig, Bahram Honary, Carl A. Pickering:
Improving transmission reliability of low-power medium access control protocols using average diversity combining. IET Wirel. Sens. Syst. 2(4): 377-384 (2012) - [j24]Yuhang Yang, Bahram Honary:
Smart Sensor Networks: Theory and Practice. Int. J. Distributed Sens. Networks 8 (2012) - [c25]Shahid Ayub, Behzad Momahed Heravi, Alireza Bahraminasab, Bahram Honary:
Pedestrian Direction of Movement Determination Using Smartphone. NGMAST 2012: 64-69 - 2011
- [j23]Bamidele Adebisi, Albert Treytl, Abdelfatteh Haidine, Alexander Portnoy, Rafi Us Shan, David Lund, Hans Pille, Bahram Honary:
IP-centric high rate narrowband PLC for smart grid applications. IEEE Commun. Mag. 49(12): 46-54 (2011) - [j22]Behzad Momahed Heravi, S. R. Kariyawasam, G. Vongas, Bahram Honary:
Switchable-rate quasi-cyclic low-density parity-check codes for internet protocol over high-frequency systems. IET Commun. 5(4): 505-511 (2011) - [j21]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Networks 4(8): 937-946 (2011) - [c24]Hafiz M. Asif, Ernst M. Gabidulin, Bahram Honary:
Maximum Rank Distance Codes for Space Time Block Coding: A Comparative Study. NGMAST 2011: 206-211 - 2010
- [c23]Tariq Umer, Zhiguo Ding, Bahram Honary, Hasan Ahmad:
Implementation of microscopic parameters for density estimation of heterogeneous traffic flow for VANET. CSNDSP 2010: 66-70 - [c22]Rafi Us Shan, Bahram Honary, Hassan Ahmed, David Lund, Michael Darnell:
Performance evaluation of Phase Modulation schemes for TETRA application. CSNDSP 2010: 387-391 - [c21]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
A Smart approach for GPT cryptosystem based on rank codes. ISIT 2010: 2463-2467 - [c20]Mohammad Ghamari, Antony Chung, Utz Roedig, Bahram Honary, Carl A. Pickering:
Vehicle-Driver Communication Using Off-the-Shelf Transceivers. VTC Fall 2010: 1-2 - [i2]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
A Smart Approach for GPT Cryptosystem Based on Rank Codes. CoRR abs/1006.0386 (2010) - [i1]Ernst M. Gabidulin, Haitham Rashwan, Bahram Honary:
On improving security of GPT cryptosystems. CoRR abs/1006.1057 (2010)
2000 – 2009
- 2009
- [j20]Zheng Ma, Bahram Honary, Pingzhi Fan, Erik G. Larsson:
Stopping criterion for complexity reduction of sphere decoding. IEEE Commun. Lett. 13(6): 402-404 (2009) - [j19]Daniele Tarchi, Romano Fantacci, Cagri C. Tanriover, Bahram Honary:
Novel link adaptation for TETRA cellular systems. Int. J. Commun. Syst. 22(4): 483-501 (2009) - [j18]Bamidele Adebisi, Saqib Ali, Bahram Honary:
A Hopping Code for MMFSK in a Power-line Channel. J. Commun. 4(6): 429-436 (2009) - [c19]Haitham Rashwan, Bahram Honary, Ernst M. Gabidulin:
On improving security of GPT cryptosystems. ISIT 2009: 1110-1114 - 2008
- [j17]Lan Lan, Ying Yu Tai, Shu Lin, Behshad Memari, Bahram Honary:
New constructions of quasi-cyclic LDPC codes based on special classes of BIDBs for the AWGN and binary erasure channels. IEEE Trans. Commun. 56(1): 39-48 (2008) - 2007
- [j16]Vasileios Zarimpas, Bahram Honary, Michael Darnell:
Channel adaptive multiple I/O protocol for mixed wireless and wired channels. IET Commun. 1(5): 982-989 (2007) - [j15]Lan Lan, Ying Yu Tai, Shu Lin, Behshad Memari, Bahram Honary:
New Constructions of Quasi-Cyclic LDPC Codes Based on Special Classes of BIBDs for the AWGN and Binary Erasure Channels. IEEE Trans. Commun. 55(12): 2381 (2007) - 2006
- [c18]Lan Lan, Ying Yu Tai, Shu Lin, Behshad Memari, Bahram Honary:
New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels. AAECC 2006: 275-284 - [c17]Abdolhosein Moinian, Lina Fagoonee, Bahram Honary:
V-Shaped Viterbi Symbol Detection for Multilevel 2D Optical Storage. ICC 2006: 3167-3172 - [c16]Ernst M. Gabidulin, Abdi Moinian, Bahram Honary:
Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices. ISIT 2006: 679-683 - [c15]N. Catterall, Ernst M. Gabidulin, Bahram Honary, Vitaly A. Obernikhin:
Public Key Cryptosystem based metrics associated with GRS Codes. ISIT 2006: 729-733 - 2005
- [c14]Abdolhosein Moinian, Lina Fagoonee, Bahram Honary:
Symbol detection for multilevel two dimensional optical storage using a non-linear channel model. ICC 2005: 890-894 - 2004
- [j14]Lina Fagoonee, Bahram Honary:
Application of turbo codes to tactical communications. Comput. Networks 46(5): 741-749 (2004) - [j13]Bassem Ammar, Bahram Honary, Yu Kou, Jun Xu, Shu Lin:
Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs. IEEE Trans. Inf. Theory 50(6): 1257-1268 (2004) - [c13]Lina Fagoonee, Abdolhosein Moinian, Bahram Honary, Alexander M. van der Lee, Wim M. J. Coene:
Experimental characterization for the binary two-dimensional optical storage channel. ICC 2004: 2772-2776 - [c12]Lina Fagoonee, Bahram Honary:
On the iterative decoding of concatenated partial unit memory codes structures. ISWCS 2004: 179-182 - 2003
- [j12]Niovi Pavlidou, A. J. Han Vinck, Javad Yazdani, Bahram Honary:
Power line communications: state of the art and future trends. IEEE Commun. Mag. 41(4): 34-40 (2003) - [j11]Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar:
Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory 49(12): 3289-3293 (2003) - [c11]Lina Fagoonee, Bahram Honary:
A Multifunctional Turbo-Based Receiver Using Partial Unit Memory Codes. IMACC 2003: 24-34 - 2002
- [j10]Cagri C. Tanriover, Bahram Honary, Jun Xu, Shu Lin:
Improving turbo code error performance by multifold coding. IEEE Commun. Lett. 6(5): 193-195 (2002) - [j9]Simon Hirst, Bahram Honary:
Application of efficient Chase algorithm in decoding of generalized low-density parity-check codes. IEEE Commun. Lett. 6(9): 385-387 (2002) - [c10]David Lund, Bahram Honary:
Design and maintenance of physical processing for reconfigurable radio systems. PIMRC 2002: D96-D99 - 2001
- [j8]I. M. Boyarinov, Ian Martin, Bahram Honary:
A Class of Composite Codes with Minimum Distance 8. Probl. Inf. Transm. 37(4): 353-364 (2001) - [j7]Keith Barratt, Paul Coulton, Bahram Honary:
Defining performance limits for turbo-code assisted synchronization in DVB-S systems. IEEE Trans. Broadcast. 47(4): 348-356 (2001) - [j6]Simon Hirst, Bahram Honary, Garik Markarian:
Fast Chase algorithm with an application in turbo decoding. IEEE Trans. Commun. 49(10): 1693-1699 (2001) - [c9]Simon Hirst, Bahram Honary:
A Simple Soft-Input/Soft-Output Decoder for Hamming Codes. IMACC 2001: 38-43 - [c8]Phillip Benachour, Patrick Guy Farrell, Bahram Honary:
A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing. IMACC 2001: 166-175 - [c7]N. Komninos, Bahram Honary, Michael Darnell:
An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices. IMACC 2001: 294-300 - [c6]Phillip Benachour, Patrick Guy Farrell, Bahram Honary:
Direct sum construction of DC-free adder channel codes. ITW 2001: 96-98 - [e1]Bahram Honary:
Cryptography and Coding, 8th IMA International Conference, Cirencester, UK, December 17-19, 2001, Proceedings. Lecture Notes in Computer Science 2260, Springer 2001, ISBN 3-540-43026-1 [contents]
1990 – 1999
- 1999
- [j5]Vladimir Sidorenko, Ian Martin, Bahram Honary:
On the Rectangularity of Nonlinear Block Codes. IEEE Trans. Inf. Theory 45(2): 720-725 (1999) - [c5]Paul Chippendale, Cagri C. Tanriover, Bahram Honary:
Enhanced Image Coding for Noisy Channels. IMACC 1999: 94-103 - 1998
- [j4]Bryn Thomas, Bahram Honary:
Simulation of an Adaptive Speech Communications System Applicable to Time-Varying, Narrowband Channels. Simul. 70(5): 291-303 (1998) - [j3]F. Arani, W. He, Bahram Honary:
Reliable Speech Transmission Using Combined Adaptive-rate Sampling (ARS) and Channel Coding. Wirel. Pers. Commun. 6(3): 289-293 (1998) - 1997
- [c4]Phillip Benachour, Garik Markarian, Bahram Honary:
Trellis Decoding Techniques and Their Performance in the Adder Channel for Synchronous and Asynchronous CCMA Codes. IMACC 1997: 23-29 - [c3]Bahram Honary, Bryn Thomas, Paul Coulton, Michael Darnell:
Novel Application of Turbo Decoding for Radio Channels. IMACC 1997: 119-130 - [c2]Garik Markarian, Phillip Benachour, Bahram Honary:
Novel Decoding Technique for the Synchronous and Quasi-synchronous Multiple Access Adder Channel. IMACC 1997: 209-220 - [c1]S. Sonander, Bahram Honary:
On Generalised Concatenated Codes. IMACC 1997: 307-316 - 1996
- [j2]Vladimir Sidorenko, Garik Markarian, Bahram Honary:
Minimal trellis design for linear codes based on the Shannon product. IEEE Trans. Inf. Theory 42(6): 2048-2053 (1996) - 1995
- [j1]Pingzhi Z. Fan, Michael Darnell, Bahram Honary:
Superimposed codes for the multiaccess binary adder channel. IEEE Trans. Inf. Theory 41(4): 1178-1182 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
