Stasys Jukna. Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. Inf. Process. Lett., 69(6):267-269, 1999. [doi]
@article{Jukna99,
title = {Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs},
author = {Stasys Jukna},
year = {1999},
doi = {10.1016/S0020-0190(99)00027-7},
url = {http://dx.doi.org/10.1016/S0020-0190(99)00027-7},
researchr = {https://researchr.org/publication/Jukna99},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {69},
number = {6},
pages = {267-269},
}