default search action
Sarah Johnson 0001
Sarah J. Johnson
Person information
- affiliation: University of Newcastle, Callaghan, NSW, Australia
Other persons with the same name
- Sarah Johnson — disambiguation page
- Sarah Johnson 0002 — DePaul University, Chicago, IL, USA
- Sarah Johnson 0003
— Old Dominion University, Norfolk, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j56]Mischa Dohler, Sergio Fortes, Israat Haque, Sarah J. Johnson, Taras Maksymyuk:
Series Editorial: Internet of Things. IEEE Commun. Mag. 62(1): 24-25 (2024) - [j55]Hsiao-Hwa Chen, Sergio Fortes, Israat Haque, Ahmed R. Hussein, Sarah J. Johnson, Taras Maksymyuk:
Series Editorial: Internet of Things. IEEE Commun. Mag. 62(7): 42-43 (2024) - [j54]Muhammad Basit Shahab
Data-Driven Low-Complexity Detection in Grant-Free NOMA for IoT. IEEE Internet Things J. 11(7): 12388-12407 (2024) - [j53]Ayoob Salari
Design and Analysis of Clustering-Based Joint Channel Estimation and Signal Detection for NOMA. IEEE Trans. Veh. Technol. 73(2): 2093-2108 (2024) - [i57]Jodie A. Cochrane, Adrian Wills, Sarah J. Johnson:
Divide, Conquer, Combine Bayesian Decision Tree Sampling. CoRR abs/2403.18147 (2024) - 2023
- [j52]Mischa Dohler, Sergio Fortes, Israat Haque, Sarah J. Johnson, Taras Maksymyuk:
Series Editorial: Internet of Things. IEEE Commun. Mag. 61(10): 108-109 (2023) - [j51]Ayoob Salari
Rate-Convergence Tradeoff of Federated Learning Over Wireless Channels. IEEE Internet Things J. 10(24): 22703-22716 (2023) - [j50]Saud Khan
Joint User and Data Detection in Grant-Free NOMA With Attention-Based BiLSTM Network. IEEE Open J. Commun. Soc. 4: 1499-1515 (2023) - [i56]Jodie A. Cochrane, Adrian G. Wills, Sarah J. Johnson:
RJHMC-Tree for Exploration of the Bayesian Decision Tree Posterior. CoRR abs/2312.01577 (2023) - 2022
- [j49]Muhammad Basit Shahab
Enabling transmission status detection in grant-free power domain non-orthogonal multiple access for massive Internet of Things. Trans. Emerg. Telecommun. Technol. 33(9) (2022) - [j48]Ayoob Salari
NOMA Joint Channel Estimation and Signal Detection Using Rotational Invariant Codes and GMM-Based Clustering. IEEE Commun. Lett. 26(10): 2485-2489 (2022) - [j47]Yucheng Liu
Information Leakage in Index Coding With Sensitive and Nonsensitive Messages. IEEE J. Sel. Areas Inf. Theory 3(4): 803-814 (2022) - [j46]Emelie Ekenstedt
When Differential Privacy Implies Syntactic Privacy. IEEE Trans. Inf. Forensics Secur. 17: 2110-2124 (2022) - [c39]Yucheng Liu, Lawrence Ong
Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages. ISIT 2022: 3256-3261 - [i55]Ayoob Salari, Mahyar Shirvanimoghaddam, Muhammad Basit Shahab, Reza Arablouei, Sarah Johnson:
Clustering-based Joint Channel Estimation and Signal Detection for NOMA. CoRR abs/2201.06245 (2022) - [i54]Ayoob Salari, Mahyar Shirvanimoghaddam, Branka Vucetic, Sarah Johnson:
Rate-Convergence Tradeoff of Federated Learning over Wireless Channel. CoRR abs/2205.04672 (2022) - [i53]Yucheng Liu, Lawrence Ong
Information Leakage in Index Coding. CoRR abs/2205.10821 (2022) - [i52]Yucheng Liu, Lawrence Ong
Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages. CoRR abs/2205.10827 (2022) - [i51]Saud Khan, Salman Durrani, Muhammad Basit Shahab
Joint User and Data Detection in Grant-Free NOMA with Attention-based BiLSTM Network. CoRR abs/2209.06392 (2022) - 2021
- [j45]Muhammad Basit Shahab
Receiver Design for Uplink Power Domain NOMA With Discontinuous Transmissions. IEEE Commun. Lett. 25(8): 2738-2742 (2021) - [c38]Yucheng Liu, Lawrence Ong
Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective. ISIT 2021: 2590-2595 - [c37]Yucheng Liu, Lawrence Ong
Information Leakage in Index Coding. ITW 2021: 1-6 - [i50]Yucheng Liu, Lawrence Ong, Sarah Johnson, Jörg Kliewer, Parastoo Sadeghi, Phee Lep Yeoh:
Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective. CoRR abs/2102.01908 (2021) - 2020
- [j44]Muhammad Basit Shahab
Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey. IEEE Commun. Surv. Tutorials 22(3): 1805-1838 (2020) - [j43]Rashid Ghorbani Afkhami
A Dynamic Model of Brain Hemodynamics in Near-Infrared Spectroscopy. IEEE Trans. Biomed. Eng. 67(7): 2103-2109 (2020) - [j42]Muhammad Basit Shahab
Index Modulation Aided Uplink NOMA for Massive Machine Type Communications. IEEE Wirel. Commun. Lett. 9(12): 2159-2162 (2020) - [c36]Ayoob Salari
Clustering-based Joint Channel Estimation and Signal Detection for Grant-free NOMA. GLOBECOM (Workshops) 2020: 1-6
2010 – 2019
- 2019
- [j41]Federico Clazzer
Protograph LDPC Code Design for Asynchronous Random Access. Algorithms 12(8): 170 (2019) - [j40]Mahyar Shirvanimoghaddam
Short Block-Length Codes for Ultra-Reliable Low Latency Communications. IEEE Commun. Mag. 57(2): 130-137 (2019) - [j39]Chandra Thapa
Structural Characteristics of Two-Sender Index Coding. Entropy 21(6): 615 (2019) - [j38]Min Li
Multi-Sender Index Coding for Collaborative Broadcasting: A Rank-Minimization Approach. IEEE Trans. Commun. 67(2): 1452-1466 (2019) - [j37]Min Li
Cooperative Multi-Sender Index Coding. IEEE Trans. Inf. Theory 65(3): 1725-1739 (2019) - [c35]Mahmoud Abdolhoseini
Neuron Image Synthesizer Via Gaussian Mixture Model and Perlin Noise. ISBI 2019: 530-533 - [i49]Federico Clazzer, Balázs Matuz, Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Sarah J. Johnson:
Protograph LDPC Code Design for Asynchronous Random Access. CoRR abs/1908.01607 (2019) - 2018
- [j36]Sachini Jayasooriya
A Design of Reconfigurable Raptor Codes for Wide SNR Ranges Using a Multi-Edge Framework. IEEE Commun. Lett. 22(8): 1532-1535 (2018) - [j35]Chandra Thapa
Corrections to "Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques". IEEE Trans. Inf. Theory 64(9): 6460 (2018) - [j34]Sachini Jayasooriya
Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework. IEEE Wirel. Commun. Lett. 7(1): 110-113 (2018) - [c34]Rashid Ghorbani Afkhami
A Dynamic Model of Synthetic Resting-State Brain Hemodynamics. EUSIPCO 2018: 96-100 - [c33]Balázs Matuz, Federico Clazzer, Sarah J. Johnson
LDPC Code Design for Asynchronous Random Access. ISTC 2018: 1-5 - [c32]Behzad Asadi, Lawrence Ong
Centralized Caching with Unequal Cache Sizes. ITW 2018: 1-5 - [i48]Mahyar Shirvanimoghaddam, Mohammad Sadegh Mohammadi, Rana Abbas, Aleksandar Minja, Balázs Matuz, Guojun Han, Zihuai Lin, Yonghui Li, Sarah Johnson, Branka Vucetic:
Short Block-length Codes for Ultra-Reliable Low-Latency Communications. CoRR abs/1802.09166 (2018) - [i47]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
Centralized Caching with Unequal Cache Sizes. CoRR abs/1803.06807 (2018) - 2017
- [j33]Mahyar Shirvanimoghaddam
Massive Non-Orthogonal Multiple Access for Cellular IoT: Potentials and Limitations. IEEE Commun. Mag. 55(9): 55-61 (2017) - [j32]Behzad Asadi, Lawrence Ong
Leveraging Receiver Message Side Information in Two-Receiver Broadcast Channels: A General Approach †. Entropy 19(4): 138 (2017) - [j31]Sachini Jayasooriya
Joint optimisation technique for multi-edge type low-density parity-check codes. IET Commun. 11(1): 61-68 (2017) - [j30]Mahyar Shirvanimoghaddam
On the Fundamental Limits of Random Non-Orthogonal Multiple Access in Cellular Massive IoT. IEEE J. Sel. Areas Commun. 35(10): 2238-2252 (2017) - [j29]Behzad Asadi
The DoF Region of the Three-Receiver Gaussian MIMO Broadcast Channel With Receiver Message Side Information. IEEE Trans. Commun. 65(5): 2000-2010 (2017) - [j28]Sachini Jayasooriya
Analysis and Design of Raptor Codes Using a Multi-Edge Framework. IEEE Trans. Commun. 65(12): 5123-5136 (2017) - [j27]Chandra Thapa
Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques. IEEE Trans. Inf. Theory 63(6): 3692-3711 (2017) - [j26]Mahyar Shirvanimoghaddam
Massive Multiple Access Based on Superposition Raptor Codes for Cellular M2M Communications. IEEE Trans. Wirel. Commun. 16(1): 307-319 (2017) - [c31]Min Li, Lawrence Ong
Improved bounds for multi-sender index coding. ISIT 2017: 3060-3064 - [i46]Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong, Sarah J. Johnson:
Analysis and design of Raptor codes using a multi-edge framework. CoRR abs/1701.02415 (2017) - [i45]Min Li
Cooperative Multi-Sender Index Coding. CoRR abs/1701.03877 (2017) - [i44]Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong, Sarah J. Johnson:
Raptor Codes for Higher-Order Modulation Using a Multi-Edge Framework. CoRR abs/1701.03880 (2017) - [i43]Mahyar Shirvanimoghaddam, Massimo Condoluci, Mischa Dohler, Sarah J. Johnson:
On the Fundamental Limits of Random Non-orthogonal Multiple Access in Cellular Massive IoT. CoRR abs/1705.10471 (2017) - [i42]Chandra Thapa, Lawrence Ong, Sarah J. Johnson, Min Li:
Structural Characteristics of Two-Sender Index Coding. CoRR abs/1711.08150 (2017) - 2016
- [j25]Sachini Jayasooriya
A New Density Evolution Approximation for LDPC and Multi-Edge Type LDPC Codes. IEEE Trans. Commun. 64(10): 4044-4056 (2016) - [j24]Mahyar Shirvanimoghaddam
Raptor Codes in the Low SNR Regime. IEEE Trans. Commun. 64(11): 4449-4460 (2016) - [c30]Sarah J. Johnson
Repeat-accumulate codes for reconciliation in continuous variable quantum key distribution. AusCTW 2016: 18-23 - [c29]Mahmoud Abdolhoseini
Automated tracing of microglia using multilevel thresholding and minimum spanning trees. EMBC 2016: 1208-1211 - [c28]Chandra Thapa
Graph-Theoretic Approaches to Two-Sender Index Coding. GLOBECOM Workshops 2016: 1-6 - [c27]Mahyar Shirvanimoghaddam
Design of Raptor codes in the low SNR regime with applications in quantum key distribution. ICC 2016: 1-6 - [c26]Behzad Asadi, Lawrence Ong
A unified inner bound for the two-receiver memoryless broadcast channel with channel state and message side information. ISIT 2016: 175-179 - [c25]Mahyar Shirvanimoghaddam
Approaching the capacity of AWGN channels using multi-layer raptor codes and superposition modulation. ISIT 2016: 1914-1918 - [i41]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
A Unified Inner Bound for the Two-Receiver Memoryless Broadcast Channel with Channel State and Message Side Information. CoRR abs/1601.03121 (2016) - [i40]Mahyar Shirvanimoghaddam, Mischa Dohler, Sarah J. Johnson:
Massive Multiple Access Based on Superposition Raptor Codes for M2M Communications. CoRR abs/1602.05671 (2016) - [i39]Chandra Thapa, Lawrence Ong, Sarah J. Johnson:
Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques. CoRR abs/1603.00092 (2016) - [i38]Sachini Jayasooriya, Sarah J. Johnson, Lawrence Ong, Regina Berretta:
Optimization of Graph Based Codes for Belief Propagation Decoding. CoRR abs/1605.04661 (2016) - [i37]Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong, Sarah J. Johnson:
A Joint Optimization Technique for Multi-Edge Type LDPC Codes. CoRR abs/1605.04664 (2016) - [i36]Sachini Jayasooriya, Mahyar Shirvanimoghaddam, Lawrence Ong, Gottfried Lechner, Sarah J. Johnson:
New Density Evolution Approximation for LDPC and Multi-Edge Type LDPC Codes. CoRR abs/1605.04665 (2016) - [i35]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
The DoF Region of the Three-Receiver MIMO Broadcast Channel with Side Information and Its Relation to Index Coding Capacity. CoRR abs/1608.03377 (2016) - [i34]Chandra Thapa, Lawrence Ong, Sarah J. Johnson:
Graph-Theoretic Approaches to Two-Sender Index Coding. CoRR abs/1609.08878 (2016) - [i33]Mahyar Shirvanimoghaddam, Sarah J. Johnson:
Multiple Access Technologies for cellular M2M Communications: An Overview. CoRR abs/1611.05548 (2016) - [i32]Mahyar Shirvanimoghaddam, Mischa Dohler, Sarah J. Johnson:
Massive Non-Orthogonal Multiple Access for Cellular IoT: Potentials and Limitations. CoRR abs/1612.00552 (2016) - 2015
- [j23]Behzad Asadi, Lawrence Ong
Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel With Receiver Message Side Information. IEEE Trans. Inf. Theory 61(10): 5490-5503 (2015) - [c24]Jordan A. Turley, Michael Nilsson
A comparison of signal processing techniques for Intrinsic Optical Signal imaging in mice. EMBC 2015: 6281-6284 - [c23]Behzad Asadi, Lawrence Ong
A unified scheme for two-receiver broadcast channels with receiver message side information. ISIT 2015: 386-390 - [c22]Chandra Thapa
A new index coding scheme exploiting interlinked cycles. ISIT 2015: 1024-1028 - [c21]Chandra Thapa
Generalized interlinked cycle cover for index coding. ITW Fall 2015: 4-8 - [i31]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
A Unified Scheme for Two-Receiver Broadcast Channels with Receiver Message Side Information. CoRR abs/1504.00082 (2015) - [i30]Chandra Thapa, Lawrence Ong, Sarah J. Johnson:
A New Index Coding Scheme Exploiting Interlinked Cycles. CoRR abs/1504.02168 (2015) - [i29]Chandra Thapa, Lawrence Ong, Sarah J. Johnson:
Generalized Interlinked Cycle Cover for Index Coding. CoRR abs/1504.04806 (2015) - [i28]Sarah J. Johnson, Vikram Arkalgud Chandrasetty, Andrew M. Lance:
Repeat-Accumulate Codes for Reconciliation in Continuous Variable Quantum Key Distribution. CoRR abs/1510.03510 (2015) - [i27]Mahyar Shirvanimoghaddam, Sarah J. Johnson, Andrew M. Lance:
Design of Raptor Codes in the Low SNR Regime with Applications in Quantum Key Distribution. CoRR abs/1510.07728 (2015) - [i26]Mahyar Shirvanimoghaddam, Sarah J. Johnson:
Raptor Codes in the Low SNR Regime. CoRR abs/1510.08183 (2015) - 2014
- [j22]Lawrence Ong
On the capacity of the binary-symmetric parallel-relay network. Trans. Emerg. Telecommun. Technol. 25(2): 217-230 (2014) - [j21]Behzad Asadi, Lawrence Ong
On Index Coding in Noisy Broadcast Channels with Receiver Message Side Information. IEEE Commun. Lett. 18(4): 640-643 (2014) - [j20]Vikram Arkalgud Chandrasetty, Sarah J. Johnson
Memory-efficient quasi-cyclic spatially coupled low-density parity-check and repeat-accumulate codes. IET Commun. 8(17): 3179-3188 (2014) - [c20]Lawrence Ong
Optimal coding functions for pairwise message sharing on finite-field multi-way relay channels. ICC 2014: 1866-1871 - [c19]Behzad Asadi, Lawrence Ong
The capacity of three-receiver AWGN broadcast channels with receiver message side information. ISIT 2014: 2899-2903 - [c18]Tao Ye, Darryl Veitch, Sarah Johnson:
RA-inspired codes for efficient information theoretic multi-path network security. ISITA 2014: 408-412 - [c17]Sachini Jayasooriya, Sarah J. Johnson
Optimization of graph based codes for belief propagation decoding. ITW 2014: 456-460 - [c16]Behzad Asadi, Lawrence Ong
Coding schemes for a class of receiver message side information in AWGN broadcast channels. ITW 2014: 571-575 - [i25]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
The Capacity of Three-Receiver AWGN Broadcast Channels with Receiver Message Side Information. CoRR abs/1401.1239 (2014) - [i24]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
On Index Coding in Noisy Broadcast Channels with Receiver Message Side Information. CoRR abs/1401.7404 (2014) - [i23]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
Coding Schemes for a Class of Receiver Message Side Information in AWGN Broadcast Channels. CoRR abs/1408.6039 (2014) - [i22]Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
Optimal Coding Schemes for the Three-Receiver AWGN Broadcast Channel with Receiver Message Side Information. CoRR abs/1411.5461 (2014) - 2013
- [j19]Sarah J. Johnson
Spatially Coupled Repeat-Accumulate Codes. IEEE Commun. Lett. 17(2): 373-376 (2013) - [j18]Roy Timo, Gottfried Lechner
Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design. IEEE Trans. Commun. 61(2): 753-768 (2013) - [j17]Lawrence Ong
The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources. IEEE Trans. Commun. 61(8): 3125-3135 (2013) - [i21]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
The Capacity Region of the Finite-Field Multi-Way Relay Channel with Pairwise Common Messages. CoRR abs/1301.4730 (2013) - [i20]Vikram Arkalgud Chandrasetty, Sarah J. Johnson, Gottfried Lechner:
Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes. CoRR abs/1305.5625 (2013) - 2012
- [j16]Lawrence Ong
The Capacity Region of the Restricted Two-Way Relay Channel with Any Deterministic Uplink. IEEE Commun. Lett. 16(3): 396-399 (2012) - [j15]Lawrence Ong
The Half-Duplex AWGN Single-Relay Channel: Full Decoding or Partial Decoding? IEEE Trans. Commun. 60(11): 3156-3160 (2012) - [j14]Lawrence Ong
On the Equal-Rate Capacity of the AWGN Multiway Relay Channel. IEEE Trans. Inf. Theory 58(9): 5761-5769 (2012) - [j13]Lawrence Ong
On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel. IEEE Trans. Inf. Theory 58(9): 5770-5784 (2012) - [c15]Lawrence Ong
The capacity region of restricted multi-way relay channels with deterministic uplinks. ISIT 2012: 786-790 - [c14]Lawrence Ong
The finite field multi-way relay channel with correlated sources: Beyond three users. ISIT 2012: 791-795 - [c13]Gottfried Lechner
Absorbing sets and cycles. ISTC 2012: 185-189 - [i19]Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett:
The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources. CoRR abs/1201.1684 (2012) - [i18]Lawrence Ong, Sarah J. Johnson:
The Capacity Region of Restricted Multi-Way Relay Channels with Deterministic Uplinks. CoRR abs/1205.5602 (2012) - [i17]Lawrence Ong, Roy Timo, Sarah J. Johnson:
The Finite Field Multi-Way Relay Channel with Correlated Sources: Beyond Three Users. CoRR abs/1205.5603 (2012) - [i16]Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson:
On the Equal-Rate Capacity of the AWGN Multiway Relay Channel. CoRR abs/1207.3572 (2012) - [i15]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
On the Capacity of the Binary-Symmetric Parallel-Relay Network. CoRR abs/1207.3574 (2012) - [i14]Lawrence Ong, Mehul Motani, Sarah J. Johnson:
On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel. CoRR abs/1207.3850 (2012) - [i13]Roy Timo, Gottfried Lechner, Lawrence Ong, Sarah J. Johnson:
Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design. CoRR abs/1210.0271 (2012) - 2011
- [j12]Sarah J. Johnson
Joint channel-network coding strategies for networks with low-complexity relays. Eur. Trans. Telecommun. 22(7): 396-406 (2011) - [j11]Lawrence Ong
The Capacity Region of Multiway Relay Channels Over Finite Fields With Full Data Exchange. IEEE Trans. Inf. Theory 57(5): 3016-3031 (2011) - [c12]Lawrence Ong
On achievable rate regions of the asymmetric AWGN two-way relay channel. ISIT 2011: 84-88 - [c11]Lawrence Ong
The finite field multi-way relay channel with correlated sources: The three-user case. ISIT 2011: 2238-2242 - [i12]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange. CoRR abs/1106.1969 (2011) - [i11]Lawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett:
The Finite Field Multi-Way Relay Channel with Correlated Sources: The Three-User Case. CoRR abs/1106.2886 (2011) - [i10]Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson:
On Achievable Rate Regions of the Asymmetric AWGN Two-Way Relay Channel. CoRR abs/1106.2888 (2011) - [i9]Sarah J. Johnson, Lawrence Ong, Christopher M. Kellett:
Joint Channel-Network Coding Strategies for Networks with Low Complexity Relays. CoRR abs/1110.5396 (2011) - [i8]Sarah J. Johnson, Gottfried Lechner:
Spatially Coupled Repeat-Accumulate Codes. CoRR abs/1110.6787 (2011) - [i7]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
The Half-Duplex AWGN Single-Relay Channel: Full Decoding or Partial Decoding? CoRR abs/1111.2098 (2011) - [i6]Lawrence Ong, Sarah J. Johnson:
The Capacity Region of the Restricted Two-Way Relay Channel with Any Deterministic Uplink. CoRR abs/1111.2102 (2011) - [i5]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
The Capacity of a Class of Multi-Way Relay Channels. CoRR abs/1111.3395 (2011) - [i4]Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson:
Functional-Decode-Forward for the General Discrete Memoryless Two-Way Relay Channel. CoRR abs/1111.3396 (2011) - 2010
- [j10]Lawrence Ong
An optimal coding strategy for the binary multi-way relay channel. IEEE Commun. Lett. 14(4): 330-332 (2010) - [c10]Lawrence Ong
The binary-symmetric parallel-relay network. ISIT 2010: 654-658 - [c9]Lawrence Ong
Capacity Theorems for the AWGN multi-way relay channel. ISIT 2010: 664-668 - [c8]David F. Hayes, Sarah J. Johnson
Irregular repeat-accumulate-like codes with improved error floor performance. ITW 2010: 1-5 - [i3]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
An Optimal Coding Strategy for the Binary Multi-Way Relay Channel. CoRR abs/1004.2299 (2010) - [i2]Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson:
Capacity Theorems for the AWGN Multi-Way Relay Channel. CoRR abs/1004.2300 (2010) - [i1]Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett:
The Binary-Symmetric Parallel-Relay Network. CoRR abs/1004.2303 (2010)
2000 – 2009
- 2009
- [j9]Sarah J. Johnson
Burst erasure correcting LDPC codes. IEEE Trans. Commun. 57(3): 641-652 (2009) - [j8]Sarah J. Johnson
Practical Interleavers for Repeat--Accumulate Codes. IEEE Trans. Commun. 57(5): 1225-1228 (2009) - [j7]Sarah J. Johnson
A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel. IEEE Trans. Inf. Theory 55(1): 27-32 (2009) - [c7]Lawrence Ong
Optimal schedules for the D-node half duplex phase fading MRC. ISIT 2009: 1006-1010 - 2008
- [j6]Sarah J. Johnson
Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters]. IEEE Trans. Commun. 56(8): 1201-1206 (2008) - 2006
- [j5]Sarah J. Johnson
Constraining LDPC degree distributions for improved error floor performance. IEEE Commun. Lett. 10(2): 103-105 (2006) - [c6]Sarah J. Johnson, Steven R. Weller:
Practical Interleavers for Systematic Repeat-Accumulate Codes. VTC Spring 2006: 1358-1362 - 2005
- [c5]Sarah J. Johnson
Constructions for irregular repeat-accumulate codes. ISIT 2005: 179-183 - 2004
- [j4]Sarah J. Johnson
Codes for Iterative Decoding From Partial Geometries. IEEE Trans. Commun. 52(2): 236-243 (2004) - [c4]Parastoo Sadeghi, Predrag B. Rapajic, Sarah J. Johnson:
Numerical capacity analysis of time varying fading channels using finite state Markov models. ISIT 2004: 180 - 2003
- [j3]Steven R. Weller, Sarah J. Johnson
Regular low-density parity-check codes from oval designs. Eur. Trans. Telecommun. 14(5): 399-409 (2003) - [j2]Sarah J. Johnson
A family of irregular LDPC codes with low encoding complexity. IEEE Commun. Lett. 7(2): 79-81 (2003) - [j1]Sarah J. Johnson
Resolvable 2-designs for regular low-density parity-check codes. IEEE Trans. Commun. 51(9): 1413-1419 (2003) - [c3]Sarah J. Johnson, Steven R. Weller:
High-rate LDPC codes from unital designs. GLOBECOM 2003: 2036-2040 - 2001
- [c2]Sarah J. Johnson, Steven R. Weller:
Construction of low-density parity-check codes from Kirkman triple systems. GLOBECOM 2001: 970-974 - [c1]Sarah J. Johnson
Regular low-density parity-check codes from combinatorial designs. ITW 2001: 90-92
Coauthor Index
[j47] [j46] [c39] [i53] [i52] [c38] [c37] [i50] [j39] [j38] [j37] [j35] [j34] [c32] [i47] [j32] [j31] [j29] [j28] [j27] [c31] [i46] [i45] [i44] [i42] [j25] [c28] [c26] [i41] [i39] [i38] [i37] [i36] [i35] [i34] [j23] [c23] [c22] [c21] [i31] [i30] [i29] [j22] [j21] [c20] [c19] [c17] [c16] [i25] [i24] [i23] [i22] [j18] [j17] [i21] [j16] [j15] [j14] [j13] [c15] [c14] [i19] [i18] [i17] [i16] [i15] [i14] [i13] [j12] [j11] [c12] [c11] [i12] [i11] [i10] [i9] [i7] [i6] [i5] [i4] [j10] [c10] [c9] [i3] [i2] [i1] [c7]
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-10-07 22:06 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: