I.J. Fair

962 total citations
78 papers, 665 citations indexed

About

I.J. Fair is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, I.J. Fair has authored 78 papers receiving a total of 665 indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Electrical and Electronic Engineering, 44 papers in Computer Networks and Communications and 35 papers in Artificial Intelligence. Recurrent topics in I.J. Fair's work include Advanced Wireless Communication Techniques (48 papers), Cellular Automata and Applications (34 papers) and Error Correcting Code Techniques (26 papers). I.J. Fair is often cited by papers focused on Advanced Wireless Communication Techniques (48 papers), Cellular Automata and Applications (34 papers) and Error Correcting Code Techniques (26 papers). I.J. Fair collaborates with scholars based in Canada, United States and Australia. I.J. Fair's co-authors include Witold A. Krzymień, Xin Yan, W.D. Grover, R.I. MacDonald, Yan Xin, Yue Wang, Xiaodai Dong, Bartosz Mielczarek, V.K. Bhargava and Ge Li and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Access and IEEE Journal on Selected Areas in Communications.

In The Last Decade

I.J. Fair

70 papers receiving 642 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
I.J. Fair Canada	13	516	402	214	168	70	78	665
Kyeongcheol Yang South Korea	20	1.1k 2.1×	821 2.0×	644 3.0×	135 0.8×	42 0.6×	72	1.3k
U. Wachsmann Germany	8	782 1.5×	699 1.7×	168 0.8×	66 0.4×	41 0.6×	13	856
Jean‐Claude Belfiore France	18	1.1k 2.1×	860 2.1×	303 1.4×	71 0.4×	79 1.1×	74	1.2k
Eirik Rosnes Norway	16	366 0.7×	433 1.1×	418 2.0×	71 0.4×	61 0.9×	88	721
Shrinivas Kudekar Switzerland	13	664 1.3×	756 1.9×	151 0.7×	109 0.6×	116 1.7×	25	906
Andrew Thangaraj India	12	676 1.3×	573 1.4×	276 1.3×	111 0.7×	91 1.3×	81	861
Hong‐Yeop Song South Korea	16	528 1.0×	349 0.9×	451 2.1×	189 1.1×	25 0.4×	128	703
A. Robert Calderbank United States	6	474 0.9×	390 1.0×	150 0.7×	29 0.2×	46 0.7×	10	619
Hoyoung Yoo South Korea	12	210 0.4×	260 0.6×	174 0.8×	56 0.3×	26 0.4×	55	423
Navin Kashyap India	11	300 0.6×	272 0.7×	132 0.6×	86 0.5×	110 1.6×	85	456

Countries citing papers authored by I.J. Fair

Since Specialization

Citations

This map shows the geographic impact of I.J. Fair's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by I.J. Fair with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites I.J. Fair more than expected).

Fields of papers citing papers by I.J. Fair

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by I.J. Fair. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by I.J. Fair. The network helps show where I.J. Fair may publish in the future.

Co-authorship network of co-authors of I.J. Fair

This figure shows the co-authorship network connecting the top 25 collaborators of I.J. Fair. A scholar is included among the top collaborators of I.J. Fair based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with I.J. Fair. I.J. Fair is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fair, I.J., et al.. (2018). Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes. IEEE Transactions on Communications. 67(2). 890–902. 12 indexed citations

Fair, I.J., et al.. (2016). Construction of minimal sets for capacity-approaching variable-length constrained sequence codes. 8. 255–259. 7 indexed citations

Fair, I.J., et al.. (2014). Evaluation of the capacity of constrained codes with multiple constrained signalling dimensions. IET Communications. 8(13). 2238–2245.

Fair, I.J., et al.. (2013). DC‐free codes with complex‐valued signalling constellations. IET Communications. 7(2). 91–97. 3 indexed citations

Fair, I.J. & C Jamieson. (2013). Tabular construction of balanced codes. Electronics Letters. 49(16). 997–999. 1 indexed citations

Fair, I.J., et al.. (2012). Variable-Length Constrained Sequence Codes. IEEE Communications Letters. 17(1). 139–142. 12 indexed citations

Nikolaidis, Ioanis, et al.. (2011). Improved Algorithm for Constructing Constrained Codes with State-Independent Decoding. IEEE Communications Letters. 15(3). 272–274. 2 indexed citations

Fair, I.J., et al.. (2010). Construction of Constrained Codes for State-Independent Decoding. IEEE Journal on Selected Areas in Communications. 28(2). 193–199. 9 indexed citations

Bai, Chunmei, Bartosz Mielczarek, I.J. Fair, & Witold A. Krzymień. (2008). Sub-Block Recovery Scheme for Iterative Decoding of Turbo Codes with the Sub-Block Structure. IEICE Transactions on Communications. E91-B(5). 1375–1386. 3 indexed citations

10.

Xin, Yan & I.J. Fair. (2008). Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns. IEEE Transactions on Information Theory. 54(3). 1363–1367.

11.

Wang, Yue, Xiaodai Dong, & I.J. Fair. (2007). Spectrum Shaping and NBI Suppression in UWB Communications. IEEE Transactions on Wireless Communications. 6(5). 1944–1952. 19 indexed citations

12.

Fair, I.J.. (2006). Construction of Codewords and Pulse Shapes to Meet Spectral Requirements. 2006 IEEE International Conference on Communications. 45. 1243–1248. 2 indexed citations

13.

Mielczarek, Bartosz, et al.. (2006). WLC45-1: Turbo Coded Type-II H-ARQ Scheme with Incremental Redundancy Using Sub-Block Recovery. Globecom. 1–5. 1 indexed citations

14.

Fair, I.J., et al.. (2005). Modified minimum squared weight selection criterion for DC-free multimode codes. Electronics Letters. 41(17). 973–975. 4 indexed citations

15.

Yan, Xin & I.J. Fair. (2004). Peak-to-average power ratio reduction of an OFDM signal using guided scrambling coding. 40. 2390–2394. 17 indexed citations

16.

Li, Ge, et al.. (2003). Analysis of nonbinary ldpc codes using gaussian approximation. 47. 234–234. 12 indexed citations

17.

Fair, I.J. & D.R. Bull. (2003). DC-free error control coding through guided convolutional coding. 45. 297–297. 4 indexed citations

18.

Fair, I.J., et al.. (2002). On the spectral characteristics of continuous guided scrambling line codes. xliii. 784–789.

19.

Fair, I.J., et al.. (1995). Polynomials for guided scrambling line codes. IEEE Journal on Selected Areas in Communications. 13(3). 499–509. 12 indexed citations

20.

Fair, I.J., et al.. (1991). Guided scrambling: a new line coding technique for high bit rate fiber optic transmission systems. IEEE Transactions on Communications. 39(2). 289–297. 60 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact