Frédérique E. Oggier

Orcid: 0000-0003-3141-3118

Affiliations:
  • Nanyang Technological University, Singapore


According to our database1, Frédérique E. Oggier authored at least 132 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Rank weight hierarchy of some classes of polynomial codes.
Des. Codes Cryptogr., May, 2023

On parsimony and clustering.
PeerJ Comput. Sci., 2023

2022
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels.
IEEE Trans. Inf. Theory, 2022

Quorums over codes.
J. Parallel Distributed Comput., 2022

A Modular Framework for Centrality and Clustering in Complex Networks.
IEEE Access, 2022

Concurrency Control and Consistency Over Erasure Coded Data.
IEEE Access, 2022

2021
Centrality informed embedding of networks for temporal feature extraction.
Soc. Netw. Anal. Min., 2021

Renyi entropy driven hierarchical graph clustering.
PeerJ Comput. Sci., 2021

Editorial.
IEEE J. Sel. Areas Inf. Theory, 2021

An Overview of Information-Theoretic Security and Privacy: Metrics, Limits and Applications.
IEEE J. Sel. Areas Inf. Theory, 2021

On Grid Quorums for Erasure Coded Data.
Entropy, 2021

Analysis of multi-input multi-output transactions in the Bitcoin network.
Concurr. Comput. Pract. Exp., 2021

QLOC: Quorums With Local Reconstruction Codes.
IEEE Access, 2021

2020
An ego network analysis of sextortionists.
Soc. Netw. Anal. Min., 2020

A Quadratic Form Approach to Construction A of Lattices over Cyclic Algebras.
CoRR, 2020

2019
A split-and-transfer flow based entropic centrality.
PeerJ Comput. Sci., 2019

Security evaluation and design elements for a class of randomised encryptions.
IET Inf. Secur., 2019

On the Secrecy Gain of Extremal Even l-modular Lattices.
Exp. Math., 2019

2018
Entropy-based Graph Clustering - A Simulated Annealing Approach.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Entropic Centrality for non-atomic Flow Networks.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

EGRET: Extortion Graph Exploration Techniques in the Bitcoin Network.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

BiVA: Bitcoin Network Visualization & Analysis.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

2017
Performance of lattice coset codes on Universal Software Radio Peripherals.
Phys. Commun., 2017

Modular lattices from a variation of construction a over number fields.
Adv. Math. Commun., 2017

2016
Differential Erasure Codes for Efficient Archival of Versioned Data in Cloud Storage Systems.
Trans. Large Scale Data Knowl. Centered Syst., 2016

Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis.
IEEE Trans. Inf. Theory, 2016

Partially collaborative storage codes in the presence of an eavesdropper.
Int. J. Inf. Coding Theory, 2016

DiVers: An erasure code based storage architecture for versioning exploiting sparsity.
Future Gener. Comput. Syst., 2016

Performance of Lattice Coset Codes on a USRP Testbed.
CoRR, 2016

Sparsity exploiting erasure coding for distributed storage of versioned data.
Computing, 2016

A study of the performance of novel storage-centric repairable codes.
Computing, 2016

On group violations of inequalities in five subgroups.
Adv. Math. Commun., 2016

On applications of orbit codes to storage.
Adv. Math. Commun., 2016

On skew polynomial codes and lattices from quotients of cyclic division algebras.
Adv. Math. Commun., 2016

On LCD codes and lattices.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Construction A of Lattices Over Number Fields and Block Fading (Wiretap) Coding.
IEEE Trans. Inf. Theory, 2015

A Perspective on the MIMO Wiretap Channel.
Proc. IEEE, 2015

On repairing erasure coded data in an active-passive mixed storage network.
Int. J. Inf. Coding Theory, 2015

Lightweight MDS Involution Matrices.
IACR Cryptol. ePrint Arch., 2015

Compressed Differential Erasure Codes for Efficient Archival of Versioned Data.
CoRR, 2015

Self-repairing codes - Local repairability for cheap and fast maintenance of erasure coded data.
Computing, 2015

2- and 3-Modular lattice wiretap codes in small dimensions.
Appl. Algebra Eng. Commun. Comput., 2015

On Algebraic Manipulation Detection codes from linear codes and their application to storage systems.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Sparsity Exploiting Erasure Coding for Resilient Storage and Efficient I/O Access in Delta Based Versioning Systems.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
Wiretap lattice codes from number fields with no small norm elements.
Des. Codes Cryptogr., 2014

Connections between Construction D and related constructions of lattices.
Des. Codes Cryptogr., 2014

On Abelian group representability of finite groups.
Adv. Math. Commun., 2014

A USRP implementation of wiretap lattice codes.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Construction and secrecy gain of a family of 5-modular lattices.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Rank weight hierarchy of some classes of cyclic codes.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Information inequalities and finite groups: an overview.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Two storage code constructions allowing partially collaborative repairs.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Constructions a of lattices from number fields and division algebras.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On storage codes allowing partially collaborative repairs.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An analysis of small dimensional fading wiretap lattice codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the Design of Storage Orbit Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Lattice Encoding of Cyclic Codes from Skew-Polynomial Rings.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Lattice network coding over euclidean domains.
Proceedings of the 22nd European Signal Processing Conference, 2014

2013
Iterated Space-Time Code Constructions From Cyclic Algebras.
IEEE Trans. Inf. Theory, 2013

A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions.
IEEE Trans. Inf. Theory, 2013

An Error Probability Approach to MIMO Wiretap Channels.
IEEE Trans. Commun., 2013

An overview of codes tailor-made for better repairability in networked distributed storage systems.
SIGACT News, 2013

Coding Techniques for Repairability in Networked Distributed Storage Systems.
Found. Trends Commun. Inf. Theory, 2013

In-network redundancy generation for opportunistic speedup of data backup.
Future Gener. Comput. Syst., 2013

Quotients of orders in cyclic algebras and space-time codes.
Adv. Math. Commun., 2013

Storage codes: Managing big data with small overheads.
Proceedings of the International Symposium on Network Coding, 2013

Enabling multiplication in lattice codes via Construction A.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Explicit constructions of quasi-uniform codes from groups.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Locally repairable codes with multiple repair alternatives.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Wiretap encoding of lattices from number fields using codes over Fp.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

RapidRAID: Pipelined erasure codes for fast data archival in distributed storage systems.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Decentralized Erasure Coding for Efficient Data Archival in Distributed Storage Systems.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Data Insertion and Archiving in Erasure-Coding Based Large-Scale Storage Systems.
Proceedings of the Distributed Computing and Internet Technology, 2013

Groups and information inequalities in 5 variables.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras.
IEEE Trans. Inf. Theory, 2012

Codes Over Matrix Rings for Space-Time Coded Modulations.
IEEE Trans. Inf. Theory, 2012

An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems
CoRR, 2012

Finite nilpotent and metacyclic groups never violate the Ingleton inequality.
Proceedings of the International Symposium on Network Coding, 2012

MIDO space-time codes from associative and nonassociative cyclic algebras.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Gaussian wiretap lattice codes from binary self-dual codes.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On the existence of generalized rank weights.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

A class of iterated fast decodable space-time codes for 2<sup>n</sup> Tx antennas.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Redundantly grouped cross-object coding for repairable storage.
Proceedings of the Asia-Pacific Workshop on Systems, 2012

2011
An Authentication Code Against Pollution Attacks in Network Coding.
IEEE/ACM Trans. Netw., 2011

The Secrecy Capacity of the MIMO Wiretap Channel.
IEEE Trans. Inf. Theory, 2011

In-Network Redundancy Generation for Opportunistic Speedup of Backup
CoRR, 2011

An Overview of Codes Tailor-made for Networked Distributed Data Storage
CoRR, 2011

Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems
CoRR, 2011

Byzantine fault tolerance of regenerating codes.
Proceedings of the 2011 IEEE International Conference on Peer-to-Peer Computing, 2011

Self-Repairing Codes for distributed storage - A projective geometric construction.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Secrecy gain of Gaussian wiretap codes from unimodular lattices.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A family of fast-decodable MIDO codes from crossed-product algebras over ℚ.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Self-repairing homomorphic codes for distributed storage systems.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Lattice Codes for the Gaussian Wiretap Channel.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

Iterated MIDO space-time code constructions.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Cyclic distributed space-time codes for wireless relay networks with no channel information.
IEEE Trans. Inf. Theory, 2010

Homophonic Coding Design for Communication Systems Employing the Encoding-Encryption Paradigm
CoRR, 2010

Lattice Code Design for the Rayleigh Fading Wiretap Channel
CoRR, 2010

An Information-Theoretic Analysis of the Security of Communication Systems Employing the Encoding-Encryption Paradigm
CoRR, 2010

Secrecy gain: A wiretap lattice code design.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Fast-decodable MIDO codes from crossed product algebras.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A wire-tap approach to enhance security in communication systems using the encoding-encryption paradigm.
Proceedings of the 17th International Conference on Telecommunications, 2010

2009
Differential distributed cayley space-time codes.
IEEE Trans. Wirel. Commun., 2009

On the existence of perfect space-time codes.
IEEE Trans. Inf. Theory, 2009

On Cyclic and Nearly Cyclic Multiagent Interactions in the Plane
CoRR, 2009

Codes over M2(F2) and applications to Golden space-time coded modulation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Survey of Algebraic Unitary Codes.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes.
IEEE Trans. Signal Process., 2008

Code Design for Multihop Wireless Relay Networks.
EURASIP J. Adv. Signal Process., 2008

A practical scheme for string commitment based on the Gaussian channel.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Design of algebraic cyclic codes.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Differential distributed space-time coding based on Cayley codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Multi-receiver authentication code for network coding.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
Algebraic Cayley Differential Space-Time Codes.
IEEE Trans. Inf. Theory, 2007

Cyclic Algebras for Noncoherent Differential Space-Time Coding.
IEEE Trans. Inf. Theory, 2007

Asymptotically optimal cooperative wireless networks with reduced signaling complexity.
IEEE J. Sel. Areas Commun., 2007

Cyclic Division Algebras: A Tool for Space-Time Coding.
Found. Trends Commun. Inf. Theory, 2007

A Coding Scheme for Wireless Networks with Multiple Antenna Nodes and No Channel Information.
Proceedings of the IEEE International Conference on Acoustics, 2007

Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields.
Proceedings of the Applied Algebra, 2007

Space-Time Codes from Crossed Product Algebras of Degree 4.
Proceedings of the Applied Algebra, 2007

2006
Perfect Space-Time Block Codes.
IEEE Trans. Inf. Theory, 2006

Algebraic lattice constellations: bounds on performance.
IEEE Trans. Inf. Theory, 2006

An Algebraic Family of Distributed Space-Time Codes for Wireless Relay Networks.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Nonintersecting subspaces based on finite alphabets.
IEEE Trans. Inf. Theory, 2005

Families of unitary matrices achieving full diversity.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
New algebraic constructions of rotated Z<sup>n</sup>-lattice constellations for the Rayleigh fading channel.
IEEE Trans. Inf. Theory, 2004

Algebraic Number Theory and Code Design for Rayleigh Fading Channels.
Found. Trends Commun. Inf. Theory, 2004

Bounds on the performance of rotated lattice constellations.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
New algebraic constructions of rotated cubic lattice constellations for the Rayleigh fading channel.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2001
Semidefinite Programs for the Design of Codes for Delay-Constrained Communication in Networks.
Proceedings of the Data Compression Conference, 2001


  Loading...