Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Manitoba" +contributor:("van Rees, John (Computer Science)"). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Manitoba

1. Nasr Esfahani, Navid. The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes.

Degree: Computer Science, 2014, University of Manitoba

 Balanced Incomplete Block Designs and Binary Linear Codes are two combinatorial designs. Due to the vast application of codes in communication the field of coding… (more)

Subjects/Keywords: Balanced incomplete block designs; Self-orthogonal codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nasr Esfahani, N. (2014). The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23843

Chicago Manual of Style (16th Edition):

Nasr Esfahani, Navid. “The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes.” 2014. Masters Thesis, University of Manitoba. Accessed July 05, 2020. http://hdl.handle.net/1993/23843.

MLA Handbook (7th Edition):

Nasr Esfahani, Navid. “The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes.” 2014. Web. 05 Jul 2020.

Vancouver:

Nasr Esfahani N. The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes. [Internet] [Masters thesis]. University of Manitoba; 2014. [cited 2020 Jul 05]. Available from: http://hdl.handle.net/1993/23843.

Council of Science Editors:

Nasr Esfahani N. The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes. [Masters Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23843

2. Livinskyi, Ivan. Asymptotic existence of Hadamard matrices.

Degree: Mathematics, 2012, University of Manitoba

We make use of a structure known as signed groups, and known sequences with zero autocorrelation to derive new results on the asymptotic existence of Hadamard matrices. Advisors/Committee Members: Craigen, Robert (Mathematics) (supervisor), Craigen, Robert (Mathematics) Prymak, Andriy (Mathematics) van Rees, John (Computer Science) (examiningcommittee).

Subjects/Keywords: Hadamard matrix

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Livinskyi, I. (2012). Asymptotic existence of Hadamard matrices. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/8915

Chicago Manual of Style (16th Edition):

Livinskyi, Ivan. “Asymptotic existence of Hadamard matrices.” 2012. Masters Thesis, University of Manitoba. Accessed July 05, 2020. http://hdl.handle.net/1993/8915.

MLA Handbook (7th Edition):

Livinskyi, Ivan. “Asymptotic existence of Hadamard matrices.” 2012. Web. 05 Jul 2020.

Vancouver:

Livinskyi I. Asymptotic existence of Hadamard matrices. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2020 Jul 05]. Available from: http://hdl.handle.net/1993/8915.

Council of Science Editors:

Livinskyi I. Asymptotic existence of Hadamard matrices. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/8915


University of Manitoba

3. Biswas, Subir. Establishing security and privacy in WAVE-enabled vehicular ad hoc networks.

Degree: Computer Science, 2013, University of Manitoba

 Security and privacy are among the growing concerns of a Vehicular Ad hoc Network (VANET) which requires a high degree of liability from its participants.… (more)

Subjects/Keywords: VANET Security; privacy; anonymity; authentication; WAVE; DSRC; proxy signature; ID-based signature; ECDSA; EDCA; OBU; RSU; vehicular communications; contention window; access category; DDoS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Biswas, S. (2013). Establishing security and privacy in WAVE-enabled vehicular ad hoc networks. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/14439

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Biswas, Subir. “Establishing security and privacy in WAVE-enabled vehicular ad hoc networks.” 2013. Thesis, University of Manitoba. Accessed July 05, 2020. http://hdl.handle.net/1993/14439.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Biswas, Subir. “Establishing security and privacy in WAVE-enabled vehicular ad hoc networks.” 2013. Web. 05 Jul 2020.

Vancouver:

Biswas S. Establishing security and privacy in WAVE-enabled vehicular ad hoc networks. [Internet] [Thesis]. University of Manitoba; 2013. [cited 2020 Jul 05]. Available from: http://hdl.handle.net/1993/14439.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Biswas S. Establishing security and privacy in WAVE-enabled vehicular ad hoc networks. [Thesis]. University of Manitoba; 2013. Available from: http://hdl.handle.net/1993/14439

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Zou, Yangsheng. The Degree Sequence Problem for 3-Hypergraphs.

Degree: Computer Science, 2016, University of Manitoba

 Currently the degree sequence problem for 3-hypergraphs is still unsolved efficiently. This paper researches the 3-hypergraphic problem in terms of edge switching and exchanges in… (more)

Subjects/Keywords: 3-hypergraphic problem; Irreducible decomposition; Intersection preserving mapping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zou, Y. (2016). The Degree Sequence Problem for 3-Hypergraphs. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31220

Chicago Manual of Style (16th Edition):

Zou, Yangsheng. “The Degree Sequence Problem for 3-Hypergraphs.” 2016. Masters Thesis, University of Manitoba. Accessed July 05, 2020. http://hdl.handle.net/1993/31220.

MLA Handbook (7th Edition):

Zou, Yangsheng. “The Degree Sequence Problem for 3-Hypergraphs.” 2016. Web. 05 Jul 2020.

Vancouver:

Zou Y. The Degree Sequence Problem for 3-Hypergraphs. [Internet] [Masters thesis]. University of Manitoba; 2016. [cited 2020 Jul 05]. Available from: http://hdl.handle.net/1993/31220.

Council of Science Editors:

Zou Y. The Degree Sequence Problem for 3-Hypergraphs. [Masters Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/31220

.