@inproceedings {43413,
	title = {Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions},
	journal = {Information Theory Workshop (ITW)},
	year = {2023},
	author = {Bollauf, Maiara and Lin, Hsuan-Yin and Ytrehus, {\O}yvind}
}
@article {43415,
	title = {Formally Unimodular Packings for the Gaussian Wiretap Channel},
	journal = {IEEE Transactions on Information Theory},
	year = {2023},
	publisher = { IEEE},
	author = {Bollauf, Maiara and Lin, Hsuan-Yin and Ytrehus, {\O}yvind}
}
@article {43200,
	title = {Proxy Path Scheduling and Erasure Reconstruction for Low Delay mmWave Communication},
	journal = {IEEE Communications Letters},
	volume = {27},
	year = {2023},
	month = {06/2023},
	pages = {1649-1653},
	publisher = { IEEE},
	keywords = {erasure reconstruction, mmWave, Multipath scheduling},
	issn = {1558-2558},
	doi = {10.1109/LCOMM.2023.3269526},
	url = {https://ieeexplore.ieee.org/document/10107383},
	author = {David Andrew {Hayes} and Ros, David and Ytrehus, {\O}yvind}
}
@inproceedings {43414,
	title = {On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes},
	journal = {International Symposium on Topics in Coding (ISTC)},
	year = {2023},
	author = {Palma R. {Persson} and Bollauf, Maiara and Lin, Hsuan-Yin and Ytrehus, {\O}yvind}
}
@inproceedings {43109,
	title = {Determining the equivocation in coded transmission over a noisy channel},
	journal = {2022 IEEE International Symposium on Information Theory (ISIT)},
	year = {2022},
	pages = {1253-1258},
	publisher = {IEEE},
	address = {Espoo, Finland},
	doi = {10.1109/ISIT50566.2022.9834781},
	url = {https://ieeexplore.ieee.org/document/9834781/http://xplorestaging.ieee.org/ielx7/9834325/9834269/09834781.pdf?arnumber=9834781},
	author = {Algr{\o}y, Joakim and Barbero, Angela and Ytrehus, {\O}yvind}
}
@inproceedings {28409,
	title = {On Evaluating Anonymity of Onion Routing},
	journal = {Selected Areas in Cryptography (28th International Conference, Virtual Event, September 29 {\textendash} October 1, 2021, Revised Selected Papers)},
	volume = {13203},
	year = {2022},
	pages = {3-24},
	publisher = {Springer Nature Switzerland},
	address = {Cham},
	abstract = {Anonymous communication networks (ACNs) aim to thwart an adversary,
  who controls or observes chunks of the communication network,
  from determining the respective identities of two communicating parties.
  We focus on low-latency ACNs such as Tor, which target a practical level
  of anonymity without incurring an unacceptable transmission delay.

While several definitions have been proposed to quantify the level of anonymity
  provided by high-latency, message-centric ACNs (such as mix-nets and DC-nets),
  this approach is less relevant to Tor, where user--destination pairs communicate
  over secure overlay circuits. Moreover, existing evaluation methods of
  traffic analysis attacks on Tor appear somewhat ad hoc and fragmented.
  We propose a fair evaluation framework for such attacks against onion
  routing systems by identifying and discussing the crucial components
  for evaluation, including how to consider various adversarial goals,
  how to factor in the adversarial ability to collect information relevant
  to the attack, and how these components combine to suitable metrics to
  quantify the adversary{\textquoteright}s success.},
	isbn = {978-3-030-99276-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-030-99277-4_1},
	url = {https://doi.org/10.1007/978-3-030-99277-4_1},
	author = {Melloni, Alessandro and Stam, Martijn and Ytrehus, {\O}yvind},
	editor = {AlTawy, Riham and H{\"u}lsing, Andreas}
}
@inproceedings {9834686,
	title = {On the Secrecy Gain of Formally Unimodular Construction A4 Lattices},
	journal = {2022 IEEE International Symposium on Information Theory (ISIT)},
	year = {2022},
	pages = {3226-3231},
	publisher = { IEEE},
	doi = {{10.1109/ISIT50566.2022.9834686},
	author = {Bollauf, Maiara and Lin, Hsuan-Yin and Ytrehus, {\O}yvind}
}
@inproceedings {28342,
	title = {The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel},
	journal = {International Zurich Seminar on Information and Communication},
	year = {2022},
	publisher = {ETH Zurich},
	address = {Zurich},
	doi = {10.3929/ethz-b-000535284},
	author = {Bollauf, Maiara and Lin, Hsuan-Yin and Ytrehus, {\O}yvind}
}
@inproceedings {28056,
	title = {Tiling of Constellations},
	journal = {2021 IEEE International Symposium on Information Theory (ISIT)},
	year = {2021},
	pages = {450-454},
	publisher = {IEEE},
	address = {Melbourne, Australia},
	doi = {10.1109/ISIT45174.2021.9518129},
	url = {https://ieeexplore.ieee.org/document/9518129/http://xplorestaging.ieee.org/ielx7/9517708/9517709/09518129.pdf?arnumber=9518129},
	author = {Bollauf, Maiara and Ytrehus, {\O}yvind}
}
@article {26357,
	title = {LDPC codes over the BEC: Bounds and decoding algorithms},
	journal = {IEEE Transactions on Communications},
	volume = {67},
	year = {2019},
	pages = {1754-1769},
	publisher = {ACM/IEEE},
	issn = {0090-6778},
	doi = {10.1109/TCOMM.2018.2879107},
	url = {https://ieeexplore.ieee.org/document/8519768/http://xplorestaging.ieee.org/ielx7/26/5497975/08519768.pdf?arnumber=8519768},
	author = {Irina E. {Bocharova} and Boris D. {Kudryashov} and Skachek, Vitaly and Rosnes, Eirik and Ytrehus, {\O}yvind}
}
@article {Greve2019,
	title = {Solving non-linear Boolean equation systems by variable elimination},
	journal = {Applicable Algebra in Engineering, Communication and Computing},
	year = {2019},
	month = {Aug},
	publisher = { Springer},
	abstract = {In this paper we study Boolean equation systems, and how to eliminate variables from them while bounding the degree of polynomials produced. A procedure for variable elimination is introduced, and we relate the techniques to Gr{\"o}bner bases and XL methods. We prove that by increasing the degree of the polynomials in the system by one for each variable eliminated, we preserve the solution space, provided that the system satisfies a particular condition. We then estimate how many variables we need to eliminate in order to solve the resulting system by re-linearization, and show that we get complexities lower than the trivial brute-force {\$}{\$}{\backslash}mathcal {\O{\}(2^n){\$}{\$}O(2n)when the system is overdetermined.},
	issn = {1432-0622},
	doi = {10.1007/s00200-019-00399-7},
	url = {https://doi.org/10.1007/s00200-019-00399-7},
	author = {Greve, Bj{\o}rn and Ytrehus, {\O}yvind and Raddum, H{\r a}vard and Fl{\o}ystad, Gunnar}
}
@article {26356,
	title = {Rate $(n-1)/n$ Systematic Memory Maximum Distance Separable Convolutional Codes},
	journal = {IEEE Transactions on Information Theory},
	volume = {64},
	year = {2018},
	month = {Jan-04-2018},
	pages = {3018 - 3030},
	publisher = {ACM/IEEE},
	issn = {0018-9448},
	doi = {10.1109/TIT.2018.2802540},
	url = {http://ieeexplore.ieee.org/document/8283508/http://xplorestaging.ieee.org/ielx7/18/8318411/08283508.pdf?arnumber=8283508},
	author = {Barbero, Angela and Ytrehus, {\O}yvind}
}
@article {25098,
	title = {Vendor malware: detection limits and mitigation},
	journal = {IEEE Computer},
	volume = {49},
	year = {2016},
	month = {08/2016},
	pages = {62-69},
	publisher = {IEEE},
	abstract = {Computing device vendors can introduce malware that is nearly impossible to detect with known methods, but microservice solutions can limit the negative impact. Malware contains instructions whose execution negatively impacts stakeholders, typically leading to unauthorized access and computation, data theft, loss of privacy, inability to inspect data, or prolonged downtime. A computing system\&$\#$39;s robustness to malware attacks strongly depends on the ability of the technical system and its stakeholders to either detect inactive malware before it executes or to detect active executing malware as soon as possible, before it causes serious damage. Many previous works discuss the general difficulty of detecting malware, but we focus on the ability of buyers and other legitimate stakeholders to detect malware inserted in computing devices by vendors and other insiders with access to the devices before they reach the buyers.},
	keywords = {Computer architecture, Computer crime, Computer security, Malware, Software Engineering, Supply chain management},
	issn = {0018-9162},
	doi = {10.1109/MC.2016.227},
	author = {Lysne, Olav and Kjell J{\o}rgen {Hole} and Otterstad, Christian and Ytrehus, {\O}yvind and Aarseth, Raymond and Tellnes, J{\o}rgen}
}
@inproceedings {25103,
	title = {Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC},
	journal = {2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC 2016)},
	year = {2016},
	month = {09/2016},
	pages = {16-20},
	publisher = {IEEE Press},
	abstract = {A novel method of low-complexity near-maximum-likelihood (ML) decoding of quasi-cyclic (QC) low-density parity-check (LDPC) codes over the binary erasure channel is presented. The idea is similar to wrap-around decoding of tail-biting convolutional codes. ML decoding is applied to a relatively short window which is cyclically shifted along the received sequence. The procedure is repeated until either all erasures have been corrected, or no new erasures are corrected at a certain round. A new upper bound on the ensemble-average ML decoding error probability for a finite-length row-regular LDPC code family is derived and presented. Furthermore, a few examples of regular and irregular QC LDPC codes are studied by simulations and their performance is compared with the ensemble-average performance. Finally, the impact of the codeword weight and stopping set size spectra on the ML and belief-propagation decoding performance is discussed.},
	author = {Irina E. {Bocharova} and Boris D. {Kudryashov} and Rosnes, Eirik and Skachek, Vitaly and Ytrehus, {\O}yvind}
}
@inproceedings {4ICMCTA_Ruting,
	title = {A Coding-based Approach to Robust Shortest-path Routing},
	journal = {4th International Castle Meeting on Coding Theory and its Applications (4ICMCTA)},
	year = {2015},
	note = {Springer CIM Series in Mathematical Sciences},
	author = {Barbero, {\'A}ngela and Ytrehus, {\O}yvind}
}
@misc {24148,
	title = {Message merging for routing},
	howpublished = {Recent Advances in Practical Network Coding and Distributed Storage},
	year = {2015},
	author = {Barbero, {\'A}ngela and Ytrehus, {\O}yvind}
}
@misc {24195,
	title = {Network coding for cyclic networks},
	howpublished = {Mathematical Coding Theory in Multimedia Streaming (15w5150), BIRS, Banff, Canada},
	year = {2015},
	author = {Barbero, {\'A}ngela and Ytrehus, {\O}yvind}
}
@misc {Simula.simula.2958,
	title = {Coding for Multipath TCP: Opportunities and Challenges},
	howpublished = {Proceedings of the 2nd International NorNet Users Workshop (NNUW-2)},
	year = {2014},
	keywords = {Workshop},
	author = {Ytrehus, {\O}yvind}
}
@misc {24151,
	title = {The entropy of network topology},
	howpublished = {COST IC 1104 meeting, Palmela, Portugal, September 17},
	year = {2014},
	author = {Ytrehus, {\O}yvind}
}
@misc {24150,
	title = {From butterflies to moths: the dark side of wireless network coding},
	howpublished = {COST IC 1104 meeting, Palmela, Portugal, September 17},
	year = {2014},
	author = {Barbero, {\'A}ngela and Ytrehus, {\O}yvind}
}
@misc {ITA14_Ruting,
	title = {Information exchange for routing protocols},
	howpublished = {Information Theory and its Applications (ITA)},
	year = {2014},
	author = {Barbero, {\'A}ngela and Ytrehus, {\O}yvind}
}
@article {23501,
	title = {Near-field passive RFID communication: Channel model and code design},
	journal = {IEEE Transactions on Communications},
	volume = {62},
	year = {2014},
	month = {05/2014},
	pages = {1716-1727},
	publisher = {IEEE Press},
	author = {Barbero, {\'A}ngela and Rosnes, Eirik and Yang, Guang and Ytrehus, {\O}yvind}
}
@inproceedings {fnr_NIK,
	title = {Personnummerering i Norge: Litt anvendt kodeteori og {\o}konomi},
	journal = {Norsk Informatikk-Konferanse (NIK)},
	year = {2013},
	author = {Helleseth, Tor and Ytrehus, {\O}yvind}
}
