Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: James S. K. Tee
@article{DBLP:journals/corr/abs-2203-09591, author = {James S. K. Tee and Giorgio Matteo Vitetta and Desmond P. Taylor}, title = {Advances in Shannon-Based Communications and Computations Approaches to Understanding Information Processing in the Brain}, journal = {CoRR}, volume = {abs/2203.09591}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2203.09591}, doi = {10.48550/ARXIV.2203.09591}, eprinttype = {arXiv}, eprint = {2203.09591}, timestamp = {Wed, 30 Mar 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2203-09591.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tmbmc/TeeT21, author = {James S. K. Tee and Desmond P. Taylor}, title = {A Quantized Representation of Intertemporal Choice in the Brain}, journal = {{IEEE} Trans. Mol. Biol. Multi Scale Commun.}, volume = {7}, number = {1}, pages = {1--9}, year = {2021}, url = {https://doi.org/10.1109/TMBMC.2020.3025244}, doi = {10.1109/TMBMC.2020.3025244}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tmbmc/TeeT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-09774, author = {James S. K. Tee and Desmond P. Taylor}, title = {What If Memory Information is Stored Inside the Neuron, Instead of in the Synapse?}, journal = {CoRR}, volume = {abs/2101.09774}, year = {2021}, url = {https://arxiv.org/abs/2101.09774}, eprinttype = {arXiv}, eprint = {2101.09774}, timestamp = {Sun, 31 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-09774.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-05362, author = {James S. K. Tee and Desmond P. Taylor}, title = {Where is Memory Information Stored in the Brain?}, journal = {CoRR}, volume = {abs/2112.05362}, year = {2021}, url = {https://arxiv.org/abs/2112.05362}, eprinttype = {arXiv}, eprint = {2112.05362}, timestamp = {Tue, 14 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-05362.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tmbmc/TeeT20, author = {James S. K. Tee and Desmond P. Taylor}, title = {Is Information in the Brain Represented in Continuous or Discrete Form?}, journal = {{IEEE} Trans. Mol. Biol. Multi Scale Commun.}, volume = {6}, number = {3}, pages = {199--209}, year = {2020}, url = {https://doi.org/10.1109/TMBMC.2020.3025249}, doi = {10.1109/TMBMC.2020.3025249}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tmbmc/TeeT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-00192, author = {James S. K. Tee and Desmond P. Taylor}, title = {A Quantized Representation of Probability in the Brain}, journal = {CoRR}, volume = {abs/2001.00192}, year = {2020}, url = {http://arxiv.org/abs/2001.00192}, eprinttype = {arXiv}, eprint = {2001.00192}, timestamp = {Mon, 13 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-00192.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tmbmc/TeeT19, author = {James S. K. Tee and Desmond P. Taylor}, title = {A Quantized Representation of Probability in the Brain}, journal = {{IEEE} Trans. Mol. Biol. Multi Scale Commun.}, volume = {5}, number = {1}, pages = {19--29}, year = {2019}, url = {https://doi.org/10.1109/TMBMC.2019.2950182}, doi = {10.1109/TMBMC.2019.2950182}, timestamp = {Tue, 08 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tmbmc/TeeT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-01631, author = {James S. K. Tee and Desmond P. Taylor}, title = {Is Information in the Brain Represented in Continuous or Discrete Form?}, journal = {CoRR}, volume = {abs/1805.01631}, year = {2018}, url = {http://arxiv.org/abs/1805.01631}, eprinttype = {arXiv}, eprint = {1805.01631}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-01631.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcom/TeeT03, author = {James S. K. Tee and Desmond P. Taylor}, title = {Suboptimal {SISO} decoding of systematic binary algebraic block codes}, journal = {{IEEE} Trans. Commun.}, volume = {51}, number = {5}, pages = {715--718}, year = {2003}, url = {https://doi.org/10.1109/TCOMM.2003.811378}, doi = {10.1109/TCOMM.2003.811378}, timestamp = {Tue, 01 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcom/TeeT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcom/TeeTM03, author = {James S. K. Tee and Desmond P. Taylor and Philippa A. Martin}, title = {Multiple serial and parallel concatenated single parity-check codes}, journal = {{IEEE} Trans. Commun.}, volume = {51}, number = {10}, pages = {1666--1675}, year = {2003}, url = {https://doi.org/10.1109/TCOMM.2003.818085}, doi = {10.1109/TCOMM.2003.818085}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcom/TeeTM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icc/TeeT02, author = {James S. K. Tee and Desmond P. Taylor}, title = {A generalised performance bounding technique for bit interleaved coded modulation systems in the Rayleigh fading channel}, booktitle = {{IEEE} International Conference on Communications, {ICC} 2002, April 28 - May 2, 2002, New York City, NY, {USA}}, pages = {1342--1346}, publisher = {{IEEE}}, year = {2002}, url = {https://doi.org/10.1109/ICC.2002.997069}, doi = {10.1109/ICC.2002.997069}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/icc/TeeT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icc/TeeT01, author = {James S. K. Tee and Desmond P. Taylor}, title = {Multiple parallel concatenated single parity check codes}, booktitle = {{IEEE} International Conference on Communications, {ICC} 2001, June 11-14, Helsinki, Finland}, pages = {60--64}, publisher = {{IEEE}}, year = {2001}, url = {https://doi.org/10.1109/ICC.2001.936273}, doi = {10.1109/ICC.2001.936273}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/icc/TeeT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/globecom/TeeT00, author = {James S. K. Tee and Desmond P. Taylor}, title = {Iterative decoding of systematic binary algebraic block codes}, booktitle = {Proceedings of the Global Telecommunications Conference, 2000. {GLOBECOM} 2000, San Francisco, CA, USA, 27 November - 1 December 2000}, pages = {842--846}, publisher = {{IEEE}}, year = {2000}, url = {https://doi.org/10.1109/GLOCOM.2000.891257}, doi = {10.1109/GLOCOM.2000.891257}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/globecom/TeeT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icc/TeeT00, author = {James S. K. Tee and Desmond P. Taylor}, title = {Multiple Serially Concatenated Single Parity Check Codes}, booktitle = {2000 {IEEE} International Conference on Communications: Global Convergence Through Communications, {ICC} 2000, New Orleans, LA, USA, June 18-22, 2000}, pages = {613--617}, publisher = {{IEEE}}, year = {2000}, url = {https://doi.org/10.1109/ICC.2000.853569}, doi = {10.1109/ICC.2000.853569}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icc/TeeT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.